Return-Path: Delivered-To: apmail-cocoon-dev-archive@www.apache.org Received: (qmail 29165 invoked from network); 1 Sep 2003 17:18:34 -0000 Received: from daedalus.apache.org (HELO apache.org) (208.185.179.12) by minotaur-2.apache.org with SMTP; 1 Sep 2003 17:18:34 -0000 Received: (qmail 63119 invoked by uid 500); 1 Sep 2003 17:18:17 -0000 Delivered-To: apmail-cocoon-dev-archive@cocoon.apache.org Received: (qmail 63083 invoked by uid 500); 1 Sep 2003 17:18:17 -0000 Mailing-List: contact dev-help@cocoon.apache.org; run by ezmlm Precedence: bulk list-help: list-unsubscribe: list-post: Reply-To: dev@cocoon.apache.org Delivered-To: mailing list dev@cocoon.apache.org Received: (qmail 63053 invoked from network); 1 Sep 2003 17:18:16 -0000 Received: from unknown (HELO gate1.stjude.org) (192.55.208.11) by daedalus.apache.org with SMTP; 1 Sep 2003 17:18:16 -0000 Received: by gate3.stjude.org; (8.9.3/1.3/10May95) id LAA1921992; Mon, 1 Sep 2003 11:24:54 -0500 (CDT) Received: from somewhere by smtpxd Received: from somewhere by smtpxd Message-ID: <1E0CC447E59C974CA5C7160D2A2854EC097D0D@SJMEMXMB04.stjude.sjcrh.local> From: "Hunsberger, Peter" To: Date: Mon, 1 Sep 2003 11:24:53 -0500 Subject: RE: CommandManager issues [was Re: Releasing 2.1.1?] MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: quoted-printable X-MimeOLE: Produced By Microsoft Exchange V6.0.6375.0 X-MS-Has-Attach: X-MS-TNEF-Correlator: X-OriginalArrivalTime: 01 Sep 2003 16:24:53.0640 (UTC) FILETIME=[931A6080:01C370A5] X-SEF-723560E2-3392-41F8-A983-A3F5486E94A: 1 content-class: urn:content-classes:message Thread-Topic: CommandManager issues [was Re: Releasing 2.1.1?] Thread-Index: AcNwo9KD7n+rfTXmQa2AhUwipniQUQAAQV3w X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N X-Spam-Rating: minotaur-2.apache.org 1.6.2 0/1000/N Giacomo Pati asks: > > I did this once upon a time, I think in C code. As I recall it's=20 > > basically the equivalent of building a Map of tasks and the=20 > calculated=20 > > delta time until they need to be executed next and then using the=20 > > minimum of these deltas. I don't think it's all that complex? This=20 > > could be a little problematic if the delta's are in the=20 > same order of=20 > > magnitude as the time to calculate them :-), but that certainly=20 > > doesn't seem to be the case here.... >=20 > 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)...