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 (Bus almost full) the largest items push through
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 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
> ...
>
> I'll get me coat.
>
>
> --
> simon wistow wireless systems coder
> "i think," i said "i think this is our fault."
