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
* 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 queu
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
carefull
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 $
* Cross David - dcross ([EMAIL PROTECTED]) wrote:
>
> return rand > 0.5;
>
cool, thats a simple but neat bit of syntax that had never occured
to me.
--
Greg McCarrollhttp://217.34.97.146/~gem/
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
Once an idea gets into my head, the only way to shake it off is to go away
and write it :)
Dave...
package Tie::Hash::Cannabinol;
use strict;
use vars qw($VERSION @ISA @EXPORT @EXPORT_OK);
require Exporter;
require Tie::Hash;
@ISA = qw(Exporter Tie::StdHash);
@EXPORT = qw();
@EXPORT_OK
