Re: 10.000 events in a Resource Calendar
"Jeroen van Meeuwen (Kolab Systems)" <[email protected]>
| Newsgroups | gmane.comp.kde.devel.kolab |
|---|---|
| Message-ID | <2aa742d54841f3c999650dca50cdb6f3__49289.7230353721$1337538156$gmane$org@kolabsys.com> |
On 2012-05-20 17:17, Christian Mollekopf wrote: > On Sunday 20 May 2012 10.35:58 Jeroen van Meeuwen wrote: >> A little further on, I may, from a set of folders (resources in a >> collection) within which I may want to re-schedule reservations. See >> >> http://wiki.kolab.org/Kolab_3.0_Resource_Management#Non-unique_resources >> > > * get the conflicting Events (Resources) for the calendar cache > * apply algorithm to update events > * update cache if you still need it > > Or do you think you need any special facilities? > Ultimately the purpose of the exercise is to either shuffle the 4 events (3 currently in the 2 calendars, 1 in the new invitation) into 4 fitting events in the 2 calendars, or conclusively fail (there's no way this fits). Using the example documented in the aforementioned article, this means that for an invitation Tue-Wed to resource collection "car", the following steps precede successful resolution: - Obtain all events that overlap with the slice of time we're attempting to make a reservation for, i.e.; - The Car #1 Wed reservation, - The Car #2 Mon-Tue reservation, - Obtain all events that overlap with the events obtained in the previous step, i.e.; - The Car #1 Mon reservation, - Insert into the pool the Tue-Wed reservation, - Shuffle reservations around between resources in the pool until everything fits with no conflicts. Wallace will need virtually all the details on which properties for which events would need to change, in order to make the necessary changes in the IMAP Calendar folders and as subsequent iTip messages may need to be sent out. Kind regards, Jeroen van Meeuwen -- Systems Architect, Kolab Systems AG e: vanmeeuwen at kolabsys.com m: +44 74 2516 3817 w: http://www.kolabsys.com pgp: 9342 BF08