From: jones@pyrite.cs.uiowa.edu (Douglas W. Jones,201H MLH,3193350740,3193382879)
Subject: Re: priority queues?????????
Date: 9 Nov 1994 03:23:23 GMT
Date: 1994-11-09T03:23:23+00:00 [thread overview]
Message-ID: <39pfbb$456@nexus.uiowa.edu> (raw)
In-Reply-To: 39ok0c$60p@columbia.acc.brad.ac.uk
From article <39ok0c$60p@columbia.acc.brad.ac.uk>,
by J.Coates@bradford.ac.uk (JC):
>
> can anybody mail me a fully working and documented ada priority queue ..
What you want is available from the following FTP and WWW servers:
ftp://ftp.cs.uiowa.edu/pub/jones
www://www.cs.uiowa.edu/~jones/index.html
Look under simulation support tools, then under event set implementations,
and you'll find a splay-tree implementation of the pending event set.
The pending event set, as used in discrete event simulation, is exactly
a priority queue. The particular implementation provided has O(log n)
expected time for enqueue and dequeue, assuming randomly distributed
priorities. It gets better if they aren't random.
The same code is in the STARS library. Either nobody uses the stuff,
or there really aren't any bugs in it. I've been using it for years.
Cross your fingers. If you really can't FTP it, I can mail it.
Doug Jones
jones@cs.uiowa.edu
prev parent reply other threads:[~1994-11-09 3:23 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1994-11-08 19:36 priority queues????????? JC
1994-11-09 3:23 ` Douglas W. Jones,201H MLH,3193350740,3193382879 [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox