File Coverage

blib/lib/Algorithm/SkipList/Node.pm

Criterion	Covered	Total	%
statement	26	26	100.0
branch	2	2	100.0
condition	2	2	100.0
subroutine	10	10	100.0
pod	6	6	100.0
total	46	46	100.0

package Algorithm::SkipList::Node;

use 5.006;
use strict;
use warnings;

our $VERSION = '1.02';

# $VERSION = eval $VERSION;

use enum qw( HEADER=0 KEY VALUE );

sub new {
  my ($class, $key, $value, $hdr) = @_;
  my $self  = [ ($hdr || [ ]), $key, $value ];
  bless $self, $class;
}

sub header {
  my ($self, $hdr) = @_;
  $self->[HEADER];
}

# sub prev {
#   my ($self, $prev) = @_;
#   return (@_ > 1) ? ( $self->[PREV] = $prev ) : $self->[PREV];
# }

sub level {
  my ($self) = @_;
  scalar( @{$self->[HEADER]} );
}


sub key {
  my ($self, $key) = @_;

  $self->[KEY];
}

sub key_cmp {
  my ($self, $right) = @_;
  # OPT: It would be nice to use $self->key instead of $self->[KEY],
  # but we gain a nearly 25% speed improvement!

  ($self->[KEY] cmp $right);
}


sub value {
  my ($self, $value) = @_;

  (@_ > 1) ? ( $self->[VALUE] = $value ) : $self->[VALUE];
}


1;

__END__