first, thanks u all !
the outlook approach is nice and i thought about it and i will need to think
about i t more deeply because for now it isn't good because i need to relate
objects from the program and i don't know if outlook can help me with this.
what i've already done its a list of reminders that i load from the db and
run over it to find...
the reminder object is not the problem because if a reminder was needed to
load 1 time it was great and not heavy at all ! the problem start when a
reminder has a recurrnce mthod (1 per week, 1 per month etc.)
storing all of them in db is no real (there is also infinity recurrence...)
so what i done, is to load all reminders that thier StartDate start already
and compute from then to now. this is good now, but if i have recurrence of
1 hour , what will be with me more one year ...
so for now i store checks on the db and compute from them (and not from
startdate).
i don't remember because i have done this long time ago but i still remember
i had a problem, it works but i know it is not the efficient way...
but hey, i think about some thing right now !!!
i think to load every, let say, 1 hour, into memory and incuding
computations. then i will store them in a binary tree with the date as key,
and then, every minute i will search the tree for the exact date in the tree
to get this minute reminders.
only a thought ....
what i ment when i wrote the post is if there any algorithm or a method
that solve this already and i will need to do the implementation.
thanks.
i will develope my thought and if i will get anywhere i will share u.
thanks.