Queue::Leaky - Queues with leaky buckets


Queue-Leaky documentation Contained in the Queue-Leaky distribution.

Index


Code Index:

NAME

Top

Queue::Leaky - Queues with leaky buckets

SYNOPSIS

Top

  use Queue::Leaky;
  my $queue = Queue::Leaky->new;

  $queue->inesrt( ... );

  while ( 1 ) {
    if ($queue->next) {
      my $message = $queue->fetch;
    }
  }

  $queue->clear;

DESCRIPTION

Top

Queue::Leaky is employed as a traffic regulator.

AUTHOR

Top

Taro Funaki <t@33rpm.jp>

LICENSE

Top

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

SEE ALSO

Top


Queue-Leaky documentation Contained in the Queue-Leaky distribution.

package Queue::Leaky;

use Moose;
use Queue::Leaky::Types;

our $VERSION = '0.01';

has 'max_items' => (
    is => 'rw',
    isa => 'Int',
    required => 1,
    default => 0,
);

has 'key_generator' => (
    is => 'rw',
    isa => 'CodeRef',
    required => 1,
    default => sub {
        return sub {
            my $self = shift;
            $self->queue;
        };
    },
);

{
    my $default = sub {
        my $class = shift;
        return sub {
            Class::MOP::load_class($class);
            $class->new;
        };
    };

    has 'queue' => (
        is       => 'rw',
        does     => 'Queue::Leaky::Driver',
        required => 1,
        coerce   => 1,
        default  => $default->( 'Queue::Leaky::Driver::Simple' ),
        handles  => [ qw(next) ],
    );

    has 'state' => (
        is       => 'rw',
        does     => 'Queue::Leaky::State',
        required => 1,
        coerce   => 1,
        default  => $default->( 'Queue::Leaky::State::Memory' ),
        handles  => {
            map { ("state_$_" => $_) } qw(get set remove incr decr)
        }
    );
}

__PACKAGE__->meta->make_immutable;

no Moose;

sub insert {
    my $self = shift;

    my $key   = $self->key_generator->($self, @_);
    my $count = $self->state_incr($key);

    if ($self->max_items && $self->max_items < $count) {
        $self->state_decr($key);
        return ();
    }

    my $rv = $self->queue->insert(@_);

    $self->state_decr($key) unless $rv;
    return $rv;
}

sub fetch {
    my $self = shift;

    my $rv = $self->queue->fetch(@_);

    if ($rv) {
        my $key = $self->key_generator->($self, @_);
        $self->state_decr($key);
    }
    return $rv;
}

sub clear {
    my $self = shift;

    my $rv = $self->queue->clear(@_);

    if ($rv) {
        my $key = $self->key_generator->($self, @_);
        $self->state_remove($key) if $key;
    }
    return $rv;
}

1;

__END__