Cross David - dcross wrote:
return $self-{$keys[rand $#keys]};
Shouldn't this just gradually start to forget more and more things using
Tie::Hash::Decay?
And then start consuming your resources when it gets the munchies?
Or chuck a whitey and start spewing out spurious data everywhere or
and are selected.
Richard
-Original Message-
From: Simon Wistow [SMTP:[EMAIL PROTECTED]]
Sent: 06 June 2001 11:11
To: [EMAIL PROTECTED]
Subject: Re: Tie::Hash::Cannabinol
Cross David - dcross wrote:
return $self-{$keys[rand $#keys]};
Shouldn't this just gradually
On Wed, 06 Jun 2001, Simon Wistow wrote:
Cross David - dcross wrote:
return $self-{$keys[rand $#keys]};
Shouldn't this just gradually start to forget more and more things using
Tie::Hash::Decay?
no .. if the program is left alone for a while it begins attaching really
carefully
* Richard Clyne ([EMAIL PROTECTED]) wrote:
I always thought that a data structure that mimicked a bus queue would
be useful.
If you request more items than are in the queue (e.g. lots of empty
seats) the queue returns the items in order. If you request less items
than are in the queue
On Wed, Jun 06, 2001 at 05:10:43AM -0500, Richard Clyne wrote:
If you request more items than are in the queue (e.g. lots of empty
seats) the queue returns the items in order. If you request less items
than are in the queue (Bus almost full) the largest items push through
and are selected.
