author | zautrix <zautrix> | 2005-04-17 16:49:25 (UTC) |
---|---|---|
committer | zautrix <zautrix> | 2005-04-17 16:49:25 (UTC) |
commit | 70b45fe97813c4fd336b7ca8fdedab13f9c2e039 (patch) (unidiff) | |
tree | 37e89cf6cc411af8c646003fcfb0d5975f38272c /libkcal/incidence.cpp | |
parent | 02dc5d8173393d2069951a5f847db5bdf69137f6 (diff) | |
download | kdepimpi-70b45fe97813c4fd336b7ca8fdedab13f9c2e039.zip kdepimpi-70b45fe97813c4fd336b7ca8fdedab13f9c2e039.tar.gz kdepimpi-70b45fe97813c4fd336b7ca8fdedab13f9c2e039.tar.bz2 |
fixes
-rw-r--r-- | libkcal/incidence.cpp | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/libkcal/incidence.cpp b/libkcal/incidence.cpp index 78fa24f..9c35b1d 100644 --- a/libkcal/incidence.cpp +++ b/libkcal/incidence.cpp | |||
@@ -1,714 +1,718 @@ | |||
1 | /* | 1 | /* |
2 | This file is part of libkcal. | 2 | This file is part of libkcal. |
3 | Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org> | 3 | Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org> |
4 | 4 | ||
5 | This library is free software; you can redistribute it and/or | 5 | This library is free software; you can redistribute it and/or |
6 | modify it under the terms of the GNU Library General Public | 6 | modify it under the terms of the GNU Library General Public |
7 | License as published by the Free Software Foundation; either | 7 | License as published by the Free Software Foundation; either |
8 | version 2 of the License, or (at your option) any later version. | 8 | version 2 of the License, or (at your option) any later version. |
9 | 9 | ||
10 | This library is distributed in the hope that it will be useful, | 10 | This library is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 | Library General Public License for more details. | 13 | Library General Public License for more details. |
14 | 14 | ||
15 | You should have received a copy of the GNU Library General Public License | 15 | You should have received a copy of the GNU Library General Public License |
16 | along with this library; see the file COPYING.LIB. If not, write to | 16 | along with this library; see the file COPYING.LIB. If not, write to |
17 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | 17 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
18 | Boston, MA 02111-1307, USA. | 18 | Boston, MA 02111-1307, USA. |
19 | */ | 19 | */ |
20 | 20 | ||
21 | #include <kglobal.h> | 21 | #include <kglobal.h> |
22 | #include <klocale.h> | 22 | #include <klocale.h> |
23 | #include <kdebug.h> | 23 | #include <kdebug.h> |
24 | 24 | ||
25 | #include "calformat.h" | 25 | #include "calformat.h" |
26 | 26 | ||
27 | #include "incidence.h" | 27 | #include "incidence.h" |
28 | #include "todo.h" | 28 | #include "todo.h" |
29 | 29 | ||
30 | using namespace KCal; | 30 | using namespace KCal; |
31 | 31 | ||
32 | Incidence::Incidence() : | 32 | Incidence::Incidence() : |
33 | IncidenceBase(), | 33 | IncidenceBase(), |
34 | mRelatedTo(0), mSecrecy(SecrecyPublic), mPriority(3) | 34 | mRelatedTo(0), mSecrecy(SecrecyPublic), mPriority(3) |
35 | { | 35 | { |
36 | mRecurrence = new Recurrence(this); | 36 | mRecurrence = new Recurrence(this); |
37 | mCancelled = false; | 37 | mCancelled = false; |
38 | recreate(); | 38 | recreate(); |
39 | mHasStartDate = true; | 39 | mHasStartDate = true; |
40 | mAlarms.setAutoDelete(true); | 40 | mAlarms.setAutoDelete(true); |
41 | mAttachments.setAutoDelete(true); | 41 | mAttachments.setAutoDelete(true); |
42 | mHasRecurrenceID = false; | 42 | mHasRecurrenceID = false; |
43 | mHoliday = false; | 43 | mHoliday = false; |
44 | mBirthday = false; | 44 | mBirthday = false; |
45 | mAnniversary = false; | 45 | mAnniversary = false; |
46 | 46 | ||
47 | } | 47 | } |
48 | 48 | ||
49 | Incidence::Incidence( const Incidence &i ) : IncidenceBase( i ) | 49 | Incidence::Incidence( const Incidence &i ) : IncidenceBase( i ) |
50 | { | 50 | { |
51 | // TODO: reenable attributes currently commented out. | 51 | // TODO: reenable attributes currently commented out. |
52 | mRevision = i.mRevision; | 52 | mRevision = i.mRevision; |
53 | mCreated = i.mCreated; | 53 | mCreated = i.mCreated; |
54 | mDescription = i.mDescription; | 54 | mDescription = i.mDescription; |
55 | mSummary = i.mSummary; | 55 | mSummary = i.mSummary; |
56 | mCategories = i.mCategories; | 56 | mCategories = i.mCategories; |
57 | // Incidence *mRelatedTo; Incidence *mRelatedTo; | 57 | // Incidence *mRelatedTo; Incidence *mRelatedTo; |
58 | mRelatedTo = 0; | 58 | mRelatedTo = 0; |
59 | mRelatedToUid = i.mRelatedToUid; | 59 | mRelatedToUid = i.mRelatedToUid; |
60 | // QPtrList<Incidence> mRelations; QPtrList<Incidence> mRelations; | 60 | // QPtrList<Incidence> mRelations; QPtrList<Incidence> mRelations; |
61 | mExDates = i.mExDates; | 61 | mExDates = i.mExDates; |
62 | mAttachments = i.mAttachments; | 62 | mAttachments = i.mAttachments; |
63 | mResources = i.mResources; | 63 | mResources = i.mResources; |
64 | mSecrecy = i.mSecrecy; | 64 | mSecrecy = i.mSecrecy; |
65 | mPriority = i.mPriority; | 65 | mPriority = i.mPriority; |
66 | mLocation = i.mLocation; | 66 | mLocation = i.mLocation; |
67 | mCancelled = i.mCancelled; | 67 | mCancelled = i.mCancelled; |
68 | mHasStartDate = i.mHasStartDate; | 68 | mHasStartDate = i.mHasStartDate; |
69 | QPtrListIterator<Alarm> it( i.mAlarms ); | 69 | QPtrListIterator<Alarm> it( i.mAlarms ); |
70 | const Alarm *a; | 70 | const Alarm *a; |
71 | while( (a = it.current()) ) { | 71 | while( (a = it.current()) ) { |
72 | Alarm *b = new Alarm( *a ); | 72 | Alarm *b = new Alarm( *a ); |
73 | b->setParent( this ); | 73 | b->setParent( this ); |
74 | mAlarms.append( b ); | 74 | mAlarms.append( b ); |
75 | 75 | ||
76 | ++it; | 76 | ++it; |
77 | } | 77 | } |
78 | mAlarms.setAutoDelete(true); | 78 | mAlarms.setAutoDelete(true); |
79 | mHasRecurrenceID = i.mHasRecurrenceID; | 79 | mHasRecurrenceID = i.mHasRecurrenceID; |
80 | mRecurrenceID = i.mRecurrenceID; | 80 | mRecurrenceID = i.mRecurrenceID; |
81 | mRecurrence = new Recurrence( *(i.mRecurrence), this ); | 81 | mRecurrence = new Recurrence( *(i.mRecurrence), this ); |
82 | mHoliday = i.mHoliday ; | 82 | mHoliday = i.mHoliday ; |
83 | mBirthday = i.mBirthday; | 83 | mBirthday = i.mBirthday; |
84 | mAnniversary = i.mAnniversary; | 84 | mAnniversary = i.mAnniversary; |
85 | } | 85 | } |
86 | 86 | ||
87 | Incidence::~Incidence() | 87 | Incidence::~Incidence() |
88 | { | 88 | { |
89 | 89 | ||
90 | Incidence *ev; | 90 | Incidence *ev; |
91 | QPtrList<Incidence> Relations = relations(); | 91 | QPtrList<Incidence> Relations = relations(); |
92 | for (ev=Relations.first();ev;ev=Relations.next()) { | 92 | for (ev=Relations.first();ev;ev=Relations.next()) { |
93 | if (ev->relatedTo() == this) ev->setRelatedTo(0); | 93 | if (ev->relatedTo() == this) ev->setRelatedTo(0); |
94 | } | 94 | } |
95 | if (relatedTo()) relatedTo()->removeRelation(this); | 95 | if (relatedTo()) relatedTo()->removeRelation(this); |
96 | delete mRecurrence; | 96 | delete mRecurrence; |
97 | 97 | ||
98 | } | 98 | } |
99 | 99 | ||
100 | bool Incidence::isHoliday() const | 100 | bool Incidence::isHoliday() const |
101 | { | 101 | { |
102 | return mHoliday; | 102 | return mHoliday; |
103 | } | 103 | } |
104 | bool Incidence::isBirthday() const | 104 | bool Incidence::isBirthday() const |
105 | { | 105 | { |
106 | 106 | ||
107 | return mBirthday ; | 107 | return mBirthday ; |
108 | } | 108 | } |
109 | bool Incidence::isAnniversary() const | 109 | bool Incidence::isAnniversary() const |
110 | { | 110 | { |
111 | return mAnniversary ; | 111 | return mAnniversary ; |
112 | 112 | ||
113 | } | 113 | } |
114 | 114 | ||
115 | bool Incidence::hasRecurrenceID() const | 115 | bool Incidence::hasRecurrenceID() const |
116 | { | 116 | { |
117 | return mHasRecurrenceID; | 117 | return mHasRecurrenceID; |
118 | } | 118 | } |
119 | 119 | ||
120 | void Incidence::setHasRecurrenceID( bool b ) | 120 | void Incidence::setHasRecurrenceID( bool b ) |
121 | { | 121 | { |
122 | mHasRecurrenceID = b; | 122 | mHasRecurrenceID = b; |
123 | } | 123 | } |
124 | 124 | ||
125 | void Incidence::setRecurrenceID(QDateTime d) | 125 | void Incidence::setRecurrenceID(QDateTime d) |
126 | { | 126 | { |
127 | mRecurrenceID = d; | 127 | mRecurrenceID = d; |
128 | mHasRecurrenceID = true; | 128 | mHasRecurrenceID = true; |
129 | updated(); | 129 | updated(); |
130 | } | 130 | } |
131 | QDateTime Incidence::recurrenceID () const | 131 | QDateTime Incidence::recurrenceID () const |
132 | { | 132 | { |
133 | return mRecurrenceID; | 133 | return mRecurrenceID; |
134 | } | 134 | } |
135 | 135 | ||
136 | bool Incidence::cancelled() const | 136 | bool Incidence::cancelled() const |
137 | { | 137 | { |
138 | return mCancelled; | 138 | return mCancelled; |
139 | } | 139 | } |
140 | void Incidence::setCancelled( bool b ) | 140 | void Incidence::setCancelled( bool b ) |
141 | { | 141 | { |
142 | mCancelled = b; | 142 | mCancelled = b; |
143 | updated(); | 143 | updated(); |
144 | } | 144 | } |
145 | bool Incidence::hasStartDate() const | 145 | bool Incidence::hasStartDate() const |
146 | { | 146 | { |
147 | return mHasStartDate; | 147 | return mHasStartDate; |
148 | } | 148 | } |
149 | 149 | ||
150 | void Incidence::setHasStartDate(bool f) | 150 | void Incidence::setHasStartDate(bool f) |
151 | { | 151 | { |
152 | if (mReadOnly) return; | 152 | if (mReadOnly) return; |
153 | mHasStartDate = f; | 153 | mHasStartDate = f; |
154 | updated(); | 154 | updated(); |
155 | } | 155 | } |
156 | 156 | ||
157 | // A string comparison that considers that null and empty are the same | 157 | // A string comparison that considers that null and empty are the same |
158 | static bool stringCompare( const QString& s1, const QString& s2 ) | 158 | static bool stringCompare( const QString& s1, const QString& s2 ) |
159 | { | 159 | { |
160 | if ( s1.isEmpty() && s2.isEmpty() ) | 160 | if ( s1.isEmpty() && s2.isEmpty() ) |
161 | return true; | 161 | return true; |
162 | return s1 == s2; | 162 | return s1 == s2; |
163 | } | 163 | } |
164 | 164 | ||
165 | bool KCal::operator==( const Incidence& i1, const Incidence& i2 ) | 165 | bool KCal::operator==( const Incidence& i1, const Incidence& i2 ) |
166 | { | 166 | { |
167 | 167 | ||
168 | if( i1.alarms().count() != i2.alarms().count() ) { | 168 | if( i1.alarms().count() != i2.alarms().count() ) { |
169 | return false; // no need to check further | 169 | return false; // no need to check further |
170 | } | 170 | } |
171 | if ( i1.alarms().count() > 0 ) { | 171 | if ( i1.alarms().count() > 0 ) { |
172 | if ( !( *(i1.alarms().first()) == *(i2.alarms().first())) ) | 172 | if ( !( *(i1.alarms().first()) == *(i2.alarms().first())) ) |
173 | { | 173 | { |
174 | qDebug("alarm not equal "); | 174 | qDebug("alarm not equal "); |
175 | return false; | 175 | return false; |
176 | } | 176 | } |
177 | } | 177 | } |
178 | #if 0 | 178 | #if 0 |
179 | QPtrListIterator<Alarm> a1( i1.alarms() ); | 179 | QPtrListIterator<Alarm> a1( i1.alarms() ); |
180 | QPtrListIterator<Alarm> a2( i2.alarms() ); | 180 | QPtrListIterator<Alarm> a2( i2.alarms() ); |
181 | for( ; a1.current() && a2.current(); ++a1, ++a2 ) { | 181 | for( ; a1.current() && a2.current(); ++a1, ++a2 ) { |
182 | if( *a1.current() == *a2.current() ) { | 182 | if( *a1.current() == *a2.current() ) { |
183 | continue; | 183 | continue; |
184 | } | 184 | } |
185 | else { | 185 | else { |
186 | return false; | 186 | return false; |
187 | } | 187 | } |
188 | } | 188 | } |
189 | #endif | 189 | #endif |
190 | 190 | ||
191 | if ( i1.hasRecurrenceID() == i2.hasRecurrenceID() ) { | 191 | if ( i1.hasRecurrenceID() == i2.hasRecurrenceID() ) { |
192 | if ( i1.hasRecurrenceID() ) { | 192 | if ( i1.hasRecurrenceID() ) { |
193 | if ( i1.recurrenceID() != i2.recurrenceID() ) | 193 | if ( i1.recurrenceID() != i2.recurrenceID() ) |
194 | return false; | 194 | return false; |
195 | } | 195 | } |
196 | 196 | ||
197 | } else { | 197 | } else { |
198 | return false; | 198 | return false; |
199 | } | 199 | } |
200 | 200 | ||
201 | if ( ! operator==( (const IncidenceBase&)i1, (const IncidenceBase&)i2 ) ) | 201 | if ( ! operator==( (const IncidenceBase&)i1, (const IncidenceBase&)i2 ) ) |
202 | return false; | 202 | return false; |
203 | if ( i1.hasStartDate() == i2.hasStartDate() ) { | 203 | if ( i1.hasStartDate() == i2.hasStartDate() ) { |
204 | if ( i1.hasStartDate() ) { | 204 | if ( i1.hasStartDate() ) { |
205 | if ( i1.dtStart() != i2.dtStart() ) | 205 | if ( i1.dtStart() != i2.dtStart() ) |
206 | return false; | 206 | return false; |
207 | } | 207 | } |
208 | } else { | 208 | } else { |
209 | return false; | 209 | return false; |
210 | } | 210 | } |
211 | if (!( *i1.recurrence() == *i2.recurrence()) ) { | 211 | if (!( *i1.recurrence() == *i2.recurrence()) ) { |
212 | qDebug("recurrence is NOT equal "); | 212 | qDebug("recurrence is NOT equal "); |
213 | return false; | 213 | return false; |
214 | } | 214 | } |
215 | return | 215 | return |
216 | // i1.created() == i2.created() && | 216 | // i1.created() == i2.created() && |
217 | stringCompare( i1.description(), i2.description() ) && | 217 | stringCompare( i1.description(), i2.description() ) && |
218 | stringCompare( i1.summary(), i2.summary() ) && | 218 | stringCompare( i1.summary(), i2.summary() ) && |
219 | i1.categories() == i2.categories() && | 219 | i1.categories() == i2.categories() && |
220 | // no need to compare mRelatedTo | 220 | // no need to compare mRelatedTo |
221 | stringCompare( i1.relatedToUid(), i2.relatedToUid() ) && | 221 | stringCompare( i1.relatedToUid(), i2.relatedToUid() ) && |
222 | // i1.relations() == i2.relations() && | 222 | // i1.relations() == i2.relations() && |
223 | i1.exDates() == i2.exDates() && | 223 | i1.exDates() == i2.exDates() && |
224 | i1.attachments() == i2.attachments() && | 224 | i1.attachments() == i2.attachments() && |
225 | i1.resources() == i2.resources() && | 225 | i1.resources() == i2.resources() && |
226 | i1.secrecy() == i2.secrecy() && | 226 | i1.secrecy() == i2.secrecy() && |
227 | i1.priority() == i2.priority() && | 227 | i1.priority() == i2.priority() && |
228 | i1.cancelled() == i2.cancelled() && | 228 | i1.cancelled() == i2.cancelled() && |
229 | stringCompare( i1.location(), i2.location() ); | 229 | stringCompare( i1.location(), i2.location() ); |
230 | } | 230 | } |
231 | 231 | ||
232 | Incidence* Incidence::recreateCloneException( QDate d ) | 232 | Incidence* Incidence::recreateCloneException( QDate d ) |
233 | { | 233 | { |
234 | Incidence* newInc = clone(); | 234 | Incidence* newInc = clone(); |
235 | newInc->recreate(); | 235 | newInc->recreate(); |
236 | if ( doesRecur() ) { | 236 | if ( doesRecur() ) { |
237 | addExDate( d ); | 237 | addExDate( d ); |
238 | newInc->recurrence()->unsetRecurs(); | 238 | newInc->recurrence()->unsetRecurs(); |
239 | if ( type() == "Event") { | 239 | if ( type() == "Event") { |
240 | int len = dtStart().secsTo( ((Event*)this)->dtEnd()); | 240 | int len = dtStart().secsTo( ((Event*)this)->dtEnd()); |
241 | QTime tim = dtStart().time(); | 241 | QTime tim = dtStart().time(); |
242 | newInc->setDtStart( QDateTime(d, tim) ); | 242 | newInc->setDtStart( QDateTime(d, tim) ); |
243 | ((Event*)newInc)->setDtEnd( newInc->dtStart().addSecs( len ) ); | 243 | ((Event*)newInc)->setDtEnd( newInc->dtStart().addSecs( len ) ); |
244 | } else { | 244 | } else { |
245 | int len = dtStart().secsTo( ((Todo*)this)->dtDue()); | 245 | int len = dtStart().secsTo( ((Todo*)this)->dtDue()); |
246 | QTime tim = ((Todo*)this)->dtDue().time(); | 246 | QTime tim = ((Todo*)this)->dtDue().time(); |
247 | ((Todo*)newInc)->setDtDue( QDateTime(d, tim) ); | 247 | ((Todo*)newInc)->setDtDue( QDateTime(d, tim) ); |
248 | ((Todo*)newInc)->setDtStart( ((Todo*)newInc)->dtDue().addSecs( -len ) ); | 248 | ((Todo*)newInc)->setDtStart( ((Todo*)newInc)->dtDue().addSecs( -len ) ); |
249 | ((Todo*)this)->setRecurDates(); | 249 | ((Todo*)this)->setRecurDates(); |
250 | } | 250 | } |
251 | newInc->setExDates( DateList () ); | 251 | newInc->setExDates( DateList () ); |
252 | } | 252 | } |
253 | return newInc; | 253 | return newInc; |
254 | } | 254 | } |
255 | 255 | ||
256 | void Incidence::recreate() | 256 | void Incidence::recreate() |
257 | { | 257 | { |
258 | setCreated(QDateTime::currentDateTime()); | 258 | setCreated(QDateTime::currentDateTime()); |
259 | 259 | ||
260 | setUid(CalFormat::createUniqueId()); | 260 | setUid(CalFormat::createUniqueId()); |
261 | 261 | ||
262 | setRevision(0); | 262 | setRevision(0); |
263 | setIDStr( ":" ); | 263 | setIDStr( ":" ); |
264 | setLastModified(QDateTime::currentDateTime()); | 264 | setLastModified(QDateTime::currentDateTime()); |
265 | } | 265 | } |
266 | void Incidence::cloneRelations( Incidence * newInc ) | 266 | void Incidence::cloneRelations( Incidence * newInc ) |
267 | { | 267 | { |
268 | // newInc is already a clone of this incidence | 268 | // newInc is already a clone of this incidence |
269 | Incidence * inc; | 269 | Incidence * inc; |
270 | Incidence * cloneInc; | 270 | Incidence * cloneInc; |
271 | QPtrList<Incidence> Relations = relations(); | 271 | QPtrList<Incidence> Relations = relations(); |
272 | for (inc=Relations.first();inc;inc=Relations.next()) { | 272 | for (inc=Relations.first();inc;inc=Relations.next()) { |
273 | cloneInc = inc->clone(); | 273 | cloneInc = inc->clone(); |
274 | cloneInc->recreate(); | 274 | cloneInc->recreate(); |
275 | cloneInc->setRelatedTo( newInc ); | 275 | cloneInc->setRelatedTo( newInc ); |
276 | inc->cloneRelations( cloneInc ); | 276 | inc->cloneRelations( cloneInc ); |
277 | } | 277 | } |
278 | } | 278 | } |
279 | void Incidence::setReadOnly( bool readOnly ) | 279 | void Incidence::setReadOnly( bool readOnly ) |
280 | { | 280 | { |
281 | IncidenceBase::setReadOnly( readOnly ); | 281 | IncidenceBase::setReadOnly( readOnly ); |
282 | recurrence()->setRecurReadOnly( readOnly); | 282 | recurrence()->setRecurReadOnly( readOnly); |
283 | } | 283 | } |
284 | 284 | ||
285 | void Incidence::setCreated(QDateTime created) | 285 | void Incidence::setCreated(QDateTime created) |
286 | { | 286 | { |
287 | if (mReadOnly) return; | 287 | if (mReadOnly) return; |
288 | mCreated = getEvenTime(created); | 288 | mCreated = getEvenTime(created); |
289 | } | 289 | } |
290 | 290 | ||
291 | QDateTime Incidence::created() const | 291 | QDateTime Incidence::created() const |
292 | { | 292 | { |
293 | return mCreated; | 293 | return mCreated; |
294 | } | 294 | } |
295 | 295 | ||
296 | void Incidence::setRevision(int rev) | 296 | void Incidence::setRevision(int rev) |
297 | { | 297 | { |
298 | if (mReadOnly) return; | 298 | if (mReadOnly) return; |
299 | mRevision = rev; | 299 | mRevision = rev; |
300 | 300 | ||
301 | updated(); | 301 | updated(); |
302 | } | 302 | } |
303 | 303 | ||
304 | int Incidence::revision() const | 304 | int Incidence::revision() const |
305 | { | 305 | { |
306 | return mRevision; | 306 | return mRevision; |
307 | } | 307 | } |
308 | 308 | ||
309 | void Incidence::setDtStart(const QDateTime &dtStart) | 309 | void Incidence::setDtStart(const QDateTime &dtStart) |
310 | { | 310 | { |
311 | 311 | ||
312 | QDateTime dt = getEvenTime(dtStart); | 312 | QDateTime dt = getEvenTime(dtStart); |
313 | recurrence()->setRecurStart( dt); | 313 | recurrence()->setRecurStart( dt); |
314 | IncidenceBase::setDtStart( dt ); | 314 | IncidenceBase::setDtStart( dt ); |
315 | } | 315 | } |
316 | 316 | ||
317 | void Incidence::setDescription(const QString &description) | 317 | void Incidence::setDescription(const QString &description) |
318 | { | 318 | { |
319 | if (mReadOnly) return; | 319 | if (mReadOnly) return; |
320 | mDescription = description; | 320 | mDescription = description; |
321 | updated(); | 321 | updated(); |
322 | } | 322 | } |
323 | 323 | ||
324 | QString Incidence::description() const | 324 | QString Incidence::description() const |
325 | { | 325 | { |
326 | return mDescription; | 326 | return mDescription; |
327 | } | 327 | } |
328 | 328 | ||
329 | 329 | ||
330 | void Incidence::setSummary(const QString &summary) | 330 | void Incidence::setSummary(const QString &summary) |
331 | { | 331 | { |
332 | if (mReadOnly) return; | 332 | if (mReadOnly) return; |
333 | mSummary = summary; | 333 | mSummary = summary; |
334 | updated(); | 334 | updated(); |
335 | } | 335 | } |
336 | 336 | ||
337 | QString Incidence::summary() const | 337 | QString Incidence::summary() const |
338 | { | 338 | { |
339 | return mSummary; | 339 | return mSummary; |
340 | } | 340 | } |
341 | void Incidence::checkCategories() | 341 | void Incidence::checkCategories() |
342 | { | 342 | { |
343 | mHoliday = mCategories.contains("Holiday") || mCategories.contains(i18n("Holiday")); | 343 | mHoliday = mCategories.contains("Holiday") || mCategories.contains(i18n("Holiday")); |
344 | mBirthday = mCategories.contains("Birthday") || mCategories.contains(i18n("Birthday")); | 344 | mBirthday = mCategories.contains("Birthday") || mCategories.contains(i18n("Birthday")); |
345 | mAnniversary = mCategories.contains("Anniversary") || mCategories.contains(i18n("Anniversary")); | 345 | mAnniversary = mCategories.contains("Anniversary") || mCategories.contains(i18n("Anniversary")); |
346 | } | 346 | } |
347 | 347 | ||
348 | void Incidence::setCategories(const QStringList &categories) | 348 | void Incidence::setCategories(const QStringList &categories) |
349 | { | 349 | { |
350 | if (mReadOnly) return; | 350 | if (mReadOnly) return; |
351 | mCategories = categories; | 351 | mCategories = categories; |
352 | checkCategories(); | 352 | checkCategories(); |
353 | updated(); | 353 | updated(); |
354 | } | 354 | } |
355 | 355 | ||
356 | // TODO: remove setCategories(QString) function | 356 | // TODO: remove setCategories(QString) function |
357 | void Incidence::setCategories(const QString &catStr) | 357 | void Incidence::setCategories(const QString &catStr) |
358 | { | 358 | { |
359 | if (mReadOnly) return; | 359 | if (mReadOnly) return; |
360 | mCategories.clear(); | 360 | mCategories.clear(); |
361 | 361 | ||
362 | if (catStr.isEmpty()) return; | 362 | if (catStr.isEmpty()) return; |
363 | 363 | ||
364 | mCategories = QStringList::split(",",catStr); | 364 | mCategories = QStringList::split(",",catStr); |
365 | 365 | ||
366 | QStringList::Iterator it; | 366 | QStringList::Iterator it; |
367 | for(it = mCategories.begin();it != mCategories.end(); ++it) { | 367 | for(it = mCategories.begin();it != mCategories.end(); ++it) { |
368 | *it = (*it).stripWhiteSpace(); | 368 | *it = (*it).stripWhiteSpace(); |
369 | } | 369 | } |
370 | checkCategories(); | 370 | checkCategories(); |
371 | updated(); | 371 | updated(); |
372 | } | 372 | } |
373 | 373 | ||
374 | QStringList Incidence::categories() const | 374 | QStringList Incidence::categories() const |
375 | { | 375 | { |
376 | return mCategories; | 376 | return mCategories; |
377 | } | 377 | } |
378 | 378 | ||
379 | QString Incidence::categoriesStr() | 379 | QString Incidence::categoriesStr() |
380 | { | 380 | { |
381 | return mCategories.join(","); | 381 | return mCategories.join(","); |
382 | } | 382 | } |
383 | QString Incidence::categoriesStrWithSpace() | ||
384 | { | ||
385 | return mCategories.join(", "); | ||
386 | } | ||
383 | 387 | ||
384 | void Incidence::setRelatedToUid(const QString &relatedToUid) | 388 | void Incidence::setRelatedToUid(const QString &relatedToUid) |
385 | { | 389 | { |
386 | if (mReadOnly) return; | 390 | if (mReadOnly) return; |
387 | mRelatedToUid = relatedToUid; | 391 | mRelatedToUid = relatedToUid; |
388 | } | 392 | } |
389 | 393 | ||
390 | QString Incidence::relatedToUid() const | 394 | QString Incidence::relatedToUid() const |
391 | { | 395 | { |
392 | return mRelatedToUid; | 396 | return mRelatedToUid; |
393 | } | 397 | } |
394 | 398 | ||
395 | void Incidence::setRelatedTo(Incidence *relatedTo) | 399 | void Incidence::setRelatedTo(Incidence *relatedTo) |
396 | { | 400 | { |
397 | //qDebug("Incidence::setRelatedTo %d ", relatedTo); | 401 | //qDebug("Incidence::setRelatedTo %d ", relatedTo); |
398 | //qDebug("setRelatedTo(Incidence *relatedTo) %s %s", summary().latin1(), relatedTo->summary().latin1() ); | 402 | //qDebug("setRelatedTo(Incidence *relatedTo) %s %s", summary().latin1(), relatedTo->summary().latin1() ); |
399 | if (mReadOnly || mRelatedTo == relatedTo) return; | 403 | if (mReadOnly || mRelatedTo == relatedTo) return; |
400 | if(mRelatedTo) { | 404 | if(mRelatedTo) { |
401 | // updated(); | 405 | // updated(); |
402 | mRelatedTo->removeRelation(this); | 406 | mRelatedTo->removeRelation(this); |
403 | } | 407 | } |
404 | mRelatedTo = relatedTo; | 408 | mRelatedTo = relatedTo; |
405 | if (mRelatedTo) { | 409 | if (mRelatedTo) { |
406 | mRelatedTo->addRelation(this); | 410 | mRelatedTo->addRelation(this); |
407 | mRelatedToUid = mRelatedTo->uid(); | 411 | mRelatedToUid = mRelatedTo->uid(); |
408 | } else { | 412 | } else { |
409 | mRelatedToUid = ""; | 413 | mRelatedToUid = ""; |
410 | } | 414 | } |
411 | } | 415 | } |
412 | 416 | ||
413 | Incidence *Incidence::relatedTo() const | 417 | Incidence *Incidence::relatedTo() const |
414 | { | 418 | { |
415 | return mRelatedTo; | 419 | return mRelatedTo; |
416 | } | 420 | } |
417 | 421 | ||
418 | QPtrList<Incidence> Incidence::relations() const | 422 | QPtrList<Incidence> Incidence::relations() const |
419 | { | 423 | { |
420 | return mRelations; | 424 | return mRelations; |
421 | } | 425 | } |
422 | 426 | ||
423 | void Incidence::addRelation(Incidence *event) | 427 | void Incidence::addRelation(Incidence *event) |
424 | { | 428 | { |
425 | if( mRelations.findRef( event ) == -1 ) { | 429 | if( mRelations.findRef( event ) == -1 ) { |
426 | mRelations.append(event); | 430 | mRelations.append(event); |
427 | //updated(); | 431 | //updated(); |
428 | } | 432 | } |
429 | } | 433 | } |
430 | 434 | ||
431 | void Incidence::removeRelation(Incidence *event) | 435 | void Incidence::removeRelation(Incidence *event) |
432 | { | 436 | { |
433 | 437 | ||
434 | mRelations.removeRef(event); | 438 | mRelations.removeRef(event); |
435 | 439 | ||
436 | // if (event->getRelatedTo() == this) event->setRelatedTo(0); | 440 | // if (event->getRelatedTo() == this) event->setRelatedTo(0); |
437 | } | 441 | } |
438 | 442 | ||
439 | bool Incidence::recursOn(const QDate &qd) const | 443 | bool Incidence::recursOn(const QDate &qd) const |
440 | { | 444 | { |
441 | if (recurrence()->recursOnPure(qd) && !isException(qd)) return true; | 445 | if (recurrence()->recursOnPure(qd) && !isException(qd)) return true; |
442 | else return false; | 446 | else return false; |
443 | } | 447 | } |
444 | 448 | ||
445 | void Incidence::setExDates(const DateList &exDates) | 449 | void Incidence::setExDates(const DateList &exDates) |
446 | { | 450 | { |
447 | if (mReadOnly) return; | 451 | if (mReadOnly) return; |
448 | mExDates = exDates; | 452 | mExDates = exDates; |
449 | 453 | ||
450 | recurrence()->setRecurExDatesCount(mExDates.count()); | 454 | recurrence()->setRecurExDatesCount(mExDates.count()); |
451 | 455 | ||
452 | updated(); | 456 | updated(); |
453 | } | 457 | } |
454 | 458 | ||
455 | void Incidence::addExDate(const QDate &date) | 459 | void Incidence::addExDate(const QDate &date) |
456 | { | 460 | { |
457 | if (mReadOnly) return; | 461 | if (mReadOnly) return; |
458 | mExDates.append(date); | 462 | mExDates.append(date); |
459 | 463 | ||
460 | recurrence()->setRecurExDatesCount(mExDates.count()); | 464 | recurrence()->setRecurExDatesCount(mExDates.count()); |
461 | 465 | ||
462 | updated(); | 466 | updated(); |
463 | } | 467 | } |
464 | 468 | ||
465 | DateList Incidence::exDates() const | 469 | DateList Incidence::exDates() const |
466 | { | 470 | { |
467 | return mExDates; | 471 | return mExDates; |
468 | } | 472 | } |
469 | 473 | ||
470 | bool Incidence::isException(const QDate &date) const | 474 | bool Incidence::isException(const QDate &date) const |
471 | { | 475 | { |
472 | DateList::ConstIterator it; | 476 | DateList::ConstIterator it; |
473 | for( it = mExDates.begin(); it != mExDates.end(); ++it ) { | 477 | for( it = mExDates.begin(); it != mExDates.end(); ++it ) { |
474 | if ( (*it) == date ) { | 478 | if ( (*it) == date ) { |
475 | return true; | 479 | return true; |
476 | } | 480 | } |
477 | } | 481 | } |
478 | 482 | ||
479 | return false; | 483 | return false; |
480 | } | 484 | } |
481 | 485 | ||
482 | void Incidence::addAttachment(Attachment *attachment) | 486 | void Incidence::addAttachment(Attachment *attachment) |
483 | { | 487 | { |
484 | if (mReadOnly || !attachment) return; | 488 | if (mReadOnly || !attachment) return; |
485 | mAttachments.append(attachment); | 489 | mAttachments.append(attachment); |
486 | updated(); | 490 | updated(); |
487 | } | 491 | } |
488 | 492 | ||
489 | void Incidence::deleteAttachment(Attachment *attachment) | 493 | void Incidence::deleteAttachment(Attachment *attachment) |
490 | { | 494 | { |
491 | mAttachments.removeRef(attachment); | 495 | mAttachments.removeRef(attachment); |
492 | } | 496 | } |
493 | 497 | ||
494 | void Incidence::deleteAttachments(const QString& mime) | 498 | void Incidence::deleteAttachments(const QString& mime) |
495 | { | 499 | { |
496 | Attachment *at = mAttachments.first(); | 500 | Attachment *at = mAttachments.first(); |
497 | while (at) { | 501 | while (at) { |
498 | if (at->mimeType() == mime) | 502 | if (at->mimeType() == mime) |
499 | mAttachments.remove(); | 503 | mAttachments.remove(); |
500 | else | 504 | else |
501 | at = mAttachments.next(); | 505 | at = mAttachments.next(); |
502 | } | 506 | } |
503 | } | 507 | } |
504 | 508 | ||
505 | QPtrList<Attachment> Incidence::attachments() const | 509 | QPtrList<Attachment> Incidence::attachments() const |
506 | { | 510 | { |
507 | return mAttachments; | 511 | return mAttachments; |
508 | } | 512 | } |
509 | 513 | ||
510 | QPtrList<Attachment> Incidence::attachments(const QString& mime) const | 514 | QPtrList<Attachment> Incidence::attachments(const QString& mime) const |
511 | { | 515 | { |
512 | QPtrList<Attachment> attachments; | 516 | QPtrList<Attachment> attachments; |
513 | QPtrListIterator<Attachment> it( mAttachments ); | 517 | QPtrListIterator<Attachment> it( mAttachments ); |
514 | Attachment *at; | 518 | Attachment *at; |
515 | while ( (at = it.current()) ) { | 519 | while ( (at = it.current()) ) { |
516 | if (at->mimeType() == mime) | 520 | if (at->mimeType() == mime) |
517 | attachments.append(at); | 521 | attachments.append(at); |
518 | ++it; | 522 | ++it; |
519 | } | 523 | } |
520 | 524 | ||
521 | return attachments; | 525 | return attachments; |
522 | } | 526 | } |
523 | 527 | ||
524 | void Incidence::setResources(const QStringList &resources) | 528 | void Incidence::setResources(const QStringList &resources) |
525 | { | 529 | { |
526 | if (mReadOnly) return; | 530 | if (mReadOnly) return; |
527 | mResources = resources; | 531 | mResources = resources; |
528 | updated(); | 532 | updated(); |
529 | } | 533 | } |
530 | 534 | ||
531 | QStringList Incidence::resources() const | 535 | QStringList Incidence::resources() const |
532 | { | 536 | { |
533 | return mResources; | 537 | return mResources; |
534 | } | 538 | } |
535 | 539 | ||
536 | 540 | ||
537 | void Incidence::setPriority(int priority) | 541 | void Incidence::setPriority(int priority) |
538 | { | 542 | { |
539 | if (mReadOnly) return; | 543 | if (mReadOnly) return; |
540 | mPriority = priority; | 544 | mPriority = priority; |
541 | updated(); | 545 | updated(); |
542 | } | 546 | } |
543 | 547 | ||
544 | int Incidence::priority() const | 548 | int Incidence::priority() const |
545 | { | 549 | { |
546 | return mPriority; | 550 | return mPriority; |
547 | } | 551 | } |
548 | 552 | ||
549 | void Incidence::setSecrecy(int sec) | 553 | void Incidence::setSecrecy(int sec) |
550 | { | 554 | { |
551 | if (mReadOnly) return; | 555 | if (mReadOnly) return; |
552 | mSecrecy = sec; | 556 | mSecrecy = sec; |
553 | updated(); | 557 | updated(); |
554 | } | 558 | } |
555 | 559 | ||
556 | int Incidence::secrecy() const | 560 | int Incidence::secrecy() const |
557 | { | 561 | { |
558 | return mSecrecy; | 562 | return mSecrecy; |
559 | } | 563 | } |
560 | 564 | ||
561 | QString Incidence::secrecyStr() const | 565 | QString Incidence::secrecyStr() const |
562 | { | 566 | { |
563 | return secrecyName(mSecrecy); | 567 | return secrecyName(mSecrecy); |
564 | } | 568 | } |
565 | 569 | ||
566 | QString Incidence::secrecyName(int secrecy) | 570 | QString Incidence::secrecyName(int secrecy) |
567 | { | 571 | { |
568 | switch (secrecy) { | 572 | switch (secrecy) { |
569 | case SecrecyPublic: | 573 | case SecrecyPublic: |
570 | return i18n("Public"); | 574 | return i18n("Public"); |
571 | break; | 575 | break; |
572 | case SecrecyPrivate: | 576 | case SecrecyPrivate: |
573 | return i18n("Private"); | 577 | return i18n("Private"); |
574 | break; | 578 | break; |
575 | case SecrecyConfidential: | 579 | case SecrecyConfidential: |
576 | return i18n("Confidential"); | 580 | return i18n("Confidential"); |
577 | break; | 581 | break; |
578 | default: | 582 | default: |
579 | return i18n("Undefined"); | 583 | return i18n("Undefined"); |
580 | break; | 584 | break; |
581 | } | 585 | } |
582 | } | 586 | } |
583 | 587 | ||
584 | QStringList Incidence::secrecyList() | 588 | QStringList Incidence::secrecyList() |
585 | { | 589 | { |
586 | QStringList list; | 590 | QStringList list; |
587 | list << secrecyName(SecrecyPublic); | 591 | list << secrecyName(SecrecyPublic); |
588 | list << secrecyName(SecrecyPrivate); | 592 | list << secrecyName(SecrecyPrivate); |
589 | list << secrecyName(SecrecyConfidential); | 593 | list << secrecyName(SecrecyConfidential); |
590 | 594 | ||
591 | return list; | 595 | return list; |
592 | } | 596 | } |
593 | 597 | ||
594 | 598 | ||
595 | QPtrList<Alarm> Incidence::alarms() const | 599 | QPtrList<Alarm> Incidence::alarms() const |
596 | { | 600 | { |
597 | return mAlarms; | 601 | return mAlarms; |
598 | } | 602 | } |
599 | 603 | ||
600 | Alarm* Incidence::newAlarm() | 604 | Alarm* Incidence::newAlarm() |
601 | { | 605 | { |
602 | Alarm* alarm = new Alarm(this); | 606 | Alarm* alarm = new Alarm(this); |
603 | mAlarms.append(alarm); | 607 | mAlarms.append(alarm); |
604 | // updated(); | 608 | // updated(); |
605 | return alarm; | 609 | return alarm; |
606 | } | 610 | } |
607 | 611 | ||
608 | void Incidence::addAlarm(Alarm *alarm) | 612 | void Incidence::addAlarm(Alarm *alarm) |
609 | { | 613 | { |
610 | mAlarms.append(alarm); | 614 | mAlarms.append(alarm); |
611 | updated(); | 615 | updated(); |
612 | } | 616 | } |
613 | 617 | ||
614 | void Incidence::removeAlarm(Alarm *alarm) | 618 | void Incidence::removeAlarm(Alarm *alarm) |
615 | { | 619 | { |
616 | mAlarms.removeRef(alarm); | 620 | mAlarms.removeRef(alarm); |
617 | updated(); | 621 | updated(); |
618 | } | 622 | } |
619 | 623 | ||
620 | void Incidence::clearAlarms() | 624 | void Incidence::clearAlarms() |
621 | { | 625 | { |
622 | mAlarms.clear(); | 626 | mAlarms.clear(); |
623 | updated(); | 627 | updated(); |
624 | } | 628 | } |
625 | 629 | ||
626 | bool Incidence::isAlarmEnabled() const | 630 | bool Incidence::isAlarmEnabled() const |
627 | { | 631 | { |
628 | Alarm* alarm; | 632 | Alarm* alarm; |
629 | for (QPtrListIterator<Alarm> it(mAlarms); (alarm = it.current()) != 0; ++it) { | 633 | for (QPtrListIterator<Alarm> it(mAlarms); (alarm = it.current()) != 0; ++it) { |
630 | if (alarm->enabled()) | 634 | if (alarm->enabled()) |
631 | return true; | 635 | return true; |
632 | } | 636 | } |
633 | return false; | 637 | return false; |
634 | } | 638 | } |
635 | 639 | ||
636 | Recurrence *Incidence::recurrence() const | 640 | Recurrence *Incidence::recurrence() const |
637 | { | 641 | { |
638 | return mRecurrence; | 642 | return mRecurrence; |
639 | } | 643 | } |
640 | void Incidence::setRecurrence( Recurrence * r) | 644 | void Incidence::setRecurrence( Recurrence * r) |
641 | { | 645 | { |
642 | delete mRecurrence; | 646 | delete mRecurrence; |
643 | mRecurrence = r; | 647 | mRecurrence = r; |
644 | } | 648 | } |
645 | 649 | ||
646 | void Incidence::setLocation(const QString &location) | 650 | void Incidence::setLocation(const QString &location) |
647 | { | 651 | { |
648 | if (mReadOnly) return; | 652 | if (mReadOnly) return; |
649 | mLocation = location; | 653 | mLocation = location; |
650 | updated(); | 654 | updated(); |
651 | } | 655 | } |
652 | 656 | ||
653 | QString Incidence::location() const | 657 | QString Incidence::location() const |
654 | { | 658 | { |
655 | return mLocation; | 659 | return mLocation; |
656 | } | 660 | } |
657 | 661 | ||
658 | ushort Incidence::doesRecur() const | 662 | ushort Incidence::doesRecur() const |
659 | { | 663 | { |
660 | if ( mRecurrence ) return mRecurrence->doesRecur(); | 664 | if ( mRecurrence ) return mRecurrence->doesRecur(); |
661 | else return Recurrence::rNone; | 665 | else return Recurrence::rNone; |
662 | } | 666 | } |
663 | 667 | ||
664 | QDateTime Incidence::getNextOccurence( const QDateTime& dt, bool* ok ) const | 668 | QDateTime Incidence::getNextOccurence( const QDateTime& dt, bool* ok ) const |
665 | { | 669 | { |
666 | QDateTime incidenceStart = dt; | 670 | QDateTime incidenceStart = dt; |
667 | *ok = false; | 671 | *ok = false; |
668 | if ( doesRecur() ) { | 672 | if ( doesRecur() ) { |
669 | bool last; | 673 | bool last; |
670 | recurrence()->getPreviousDateTime( incidenceStart , &last ); | 674 | recurrence()->getPreviousDateTime( incidenceStart , &last ); |
671 | int count = 0; | 675 | int count = 0; |
672 | if ( !last ) { | 676 | if ( !last ) { |
673 | while ( !last ) { | 677 | while ( !last ) { |
674 | ++count; | 678 | ++count; |
675 | incidenceStart = recurrence()->getNextDateTime( incidenceStart, &last ); | 679 | incidenceStart = recurrence()->getNextDateTime( incidenceStart, &last ); |
676 | if ( recursOn( incidenceStart.date() ) ) { | 680 | if ( recursOn( incidenceStart.date() ) ) { |
677 | last = true; // exit while llop | 681 | last = true; // exit while llop |
678 | } else { | 682 | } else { |
679 | if ( last ) { // no alarm on last recurrence | 683 | if ( last ) { // no alarm on last recurrence |
680 | return QDateTime (); | 684 | return QDateTime (); |
681 | } | 685 | } |
682 | int year = incidenceStart.date().year(); | 686 | int year = incidenceStart.date().year(); |
683 | // workaround for bug in recurrence | 687 | // workaround for bug in recurrence |
684 | if ( count == 100 || year < 1000 || year > 5000 ) { | 688 | if ( count == 100 || year < 1000 || year > 5000 ) { |
685 | return QDateTime (); | 689 | return QDateTime (); |
686 | } | 690 | } |
687 | incidenceStart = incidenceStart.addSecs( 1 ); | 691 | incidenceStart = incidenceStart.addSecs( 1 ); |
688 | } | 692 | } |
689 | } | 693 | } |
690 | } else { | 694 | } else { |
691 | return QDateTime (); | 695 | return QDateTime (); |
692 | } | 696 | } |
693 | } else { | 697 | } else { |
694 | if ( hasStartDate () ) { | 698 | if ( hasStartDate () ) { |
695 | incidenceStart = dtStart(); | 699 | incidenceStart = dtStart(); |
696 | } | 700 | } |
697 | if ( type() =="Todo" ) { | 701 | if ( type() =="Todo" ) { |
698 | if ( ((Todo*)this)->hasDueDate() ) | 702 | if ( ((Todo*)this)->hasDueDate() ) |
699 | incidenceStart = ((Todo*)this)->dtDue(); | 703 | incidenceStart = ((Todo*)this)->dtDue(); |
700 | } | 704 | } |
701 | } | 705 | } |
702 | if ( incidenceStart > dt ) | 706 | if ( incidenceStart > dt ) |
703 | *ok = true; | 707 | *ok = true; |
704 | return incidenceStart; | 708 | return incidenceStart; |
705 | } | 709 | } |
706 | QDateTime Incidence::dtStart() const | 710 | QDateTime Incidence::dtStart() const |
707 | { | 711 | { |
708 | if ( doesRecur() ) { | 712 | if ( doesRecur() ) { |
709 | if ( type() == "Todo" ) { | 713 | if ( type() == "Todo" ) { |
710 | ((Todo*)this)->checkSetCompletedFalse(); | 714 | ((Todo*)this)->checkSetCompletedFalse(); |
711 | } | 715 | } |
712 | } | 716 | } |
713 | return mDtStart; | 717 | return mDtStart; |
714 | } | 718 | } |