On Mon, 1 Sep 2003, Hunsberger, Peter wrote: > Giacomo Pati <[EMAIL PROTECTED]> asks: > > > > I did this once upon a time, I think in C code. As I recall it's > > > basically the equivalent of building a Map of tasks and the > > calculated > > > delta time until they need to be executed next and then using the > > > minimum of these deltas. I don't think it's all that complex? This > > > could be a little problematic if the delta's are in the > > same order of > > > magnitude as the time to calculate them :-), but that certainly > > > doesn't seem to be the case here.... > > > > Where is that code, dude :-) > > Well, after looking around on my hard drive; I still have it! It is 10 > year old OS/2 text mode code for pop-up alarms... Looking at it, it has > a linked list of data structures that it scans after each alarm > occurrence looking for the min next delta time. That simple description > is probably more useful than the code, but I can send a Zip to you > privately if you really want it (careful what you ask for)...
Ok, before you send me the zip, I have a question: Is that code also capable of determining the smallest delta from a set of Crontab like 'points-in-time' definitions? I do not have any linked list because it is too painfull to build such a list out of these definitions, isn't it? -- Giacomo Pati Otego AG, Switzerland - http://www.otego.com Orixo, the XML business alliance - http://www.orixo.com
