File Coverage

blib/lib/Array/OrdHash.pm

Criterion	Covered	Total	%
statement	98	246	39.8
branch	12	62	19.3
condition	0	6	0.0
subroutine	17	41	41.4
pod	11	11	100.0
total	138	366	37.7

#Array::OrdHash =======================

package Array::OrdHash;
our $VERSION = '1.03';

use Carp qw/croak/;
use strict;

use overload
	'""' => sub { $_[0] },
	'%{}' => sub { tied(@{ $_[0] })->[0] },
;

sub new {
	my ($class) = shift;
	my @me;
	my $ar = tie @me, $class;#.'::_array';
	my $hs = tie %{ $ar->[0] }, $class.'::_hash';
	($hs->[0], $hs->[1]) = ($ar->[1], $ar->[2]);
	$ar->[4] = $hs;
	push @me, @_ if scalar @_;
	bless \@me, $class;
}

sub List {
	my $ar = tied @{ $_[0] };
	$ar->[3] = 0 unless defined $ar->[3];
	if ($ar->[3] > $#{ $ar->[2] }) {
		undef($ar->[3]);
		return ();
	}
	($ar->[1][$ar->[3]], ${ $ar->[2][$ar->[3]] }, $ar->[3]++);
}

sub Reset {
	my $ar = tied @{ $_[0] };
	undef($ar->[3]);
	tied(%{ $ar->[0] })->[3] = -1;
}

sub Sort {
	my $ar = tied @{ (shift) };
	my %args = ( src=>'keys', @_ );
	my ($src_ind, $proc);
	my ($src, $direction) = map { lc } split /\s+/, $args{ src };
	if ($src eq 'keys') {
		$src_ind = 0;
	}
	elsif ($src eq 'values') {
		$src_ind = 1;
	}
	else {
		return;
	}
	if (defined $args{ proc } && ref $args{ proc } eq 'CODE') {
		$proc = sub { $args{ proc }->($a->[$src_ind], $b->[$src_ind]) }
	}
	else {
		$proc = ($direction eq 'desc')? sub { $b->[$src_ind] cmp $a->[$src_ind] } : sub { $a->[$src_ind] cmp $b->[$src_ind] };
	}
	my $j=0;
	foreach (sort $proc map { [$ar->[1][$_], ${ $ar->[2][$_] }, $ar->[2][$_]] } (0 .. $#{ $ar->[1] })) {
		$ar->[1][$j] = $_->[0];
		$ar->[2][$j] = $_->[2];
		$j++;
	}
}

sub Reorder {
	my $ar = tied @{ (shift) };
	my (@ks, %ks, @vs);
	foreach (@_) {
		if (exists($ar->[4][2]{ $_ }) && !exists($ks{ $_ })) {
			push @ks, $_;
			push @vs, $ar->[4][2]{ $_ };
			$ks{ $_ } = $ar->[4][2]{ $_ };
		}
	}
	$ar->[4][0] = $ar->[1] = \@ks;
	$ar->[4][1] = $ar->[2] = \@vs;
	$ar->[4][2] = \%ks;
}

sub Indices {
	my $ar = tied @{ (shift) };
	my @ret = ();
	return @ret unless @_;
	my %ks = map { $_, -1 } @_;
	my $cnt = 0;
	foreach (keys %ks) {
		$cnt++ if (exists $ar->[4][2]{ $_ });
	}
	if ($cnt) {
		my $i = 0;
		foreach (@{ $ar->[1] }) {
			if (exists $ks{ $_ }) {
				$ks{ $_ } = $i;
				$cnt--;
				last unless $cnt;
			}
			$i++;
		}
		push @ret, $ks{ $_ } foreach (@_);
	}
	@ret;
}

sub Last {
	my $ar = tied @{ (shift) };
	$ar->[4][3] == $#{ $ar->[2] };
}
sub First { (tied @{ (shift) })->[4][3] == 0 }

sub Length { scalar @{ $_[0] } }

sub Keys {
	my $ar = tied @{ (shift) };
	if (@_) { @{ $ar->[1] }[@_] }
	else { @{ $ar->[1] } }
}

sub Values {
	my $ar = tied @{ (shift) };
	if (@_) { (map { $$_ } @{ $ar->[2] })[@_] }
	else { map { $$_ } @{ $ar->[2] } }
}

sub TIEARRAY {
	bless [
		{}, 			#hash ref
		[], 			#keys
		[], 			#values refs
		undef,		#pointer
		undef,		#tied hash (array) ref
	], $_[0];
}

sub FETCH {
	${ $_[0]->[2][$_[1]] };
}

sub STORE {
	croak("Index $_[1] doesn't exist") if $_[1] > $#{ $_[0]->[2] };
	${ $_[0]->[2][$_[1]] } = $_[2];
}

sub EXISTS {
	exists $_[0]->[2][$_[1]];
}

sub FETCHSIZE {
	scalar @{ $_[0]->[2] };
}

sub DELETE {
	return if $_[1] > $#{ $_[0]->[2] };
	delete $_[0]->[4][2]{ $_[0]->[1][$_[1]] };
	[splice(@{ $_[0]->[1] }, $_[1], 1), ${ splice(@{ $_[0]->[2] }, $_[1], 1) }];
}

sub SPLICE {
	my ($self, $offset, $len) = (shift, shift, shift);
	my (@k, @v, @ki, @vi, @ret, $k);
	my $start;
	my $lastind = $#{ $self->[2] };
	if ($offset < 0) {
		croak("Offset $offset is illegal") if -$offset > $lastind+1;
		$start = $lastind + $offset+1;
	}
	elsif ($offset > $lastind+1) {
		$start = $lastind+1;
	}
	else {
		$start = int $offset;
	}
	if ($len) {
		@k = splice @{ $self->[1] }, $start, $len;
		@v = splice @{ $self->[2] }, $start, $len;
		while (@k) {
			$k = shift @k;
			delete $self->[4][2]{ $k };
			push @ret, $k, ${ shift(@v) };
		}
	}
	while (@_) {
		($k, my $v) = (shift, shift);
		if (exists($self->[4][2]{ $k })) {
			${ $self->[4][2]{ $k } } = $v;
		}
		else {
			push @ki, $k;
			push @vi, \$v;
			$self->[4][2]{ $k } = \$v;
		}
	}
	if (@ki) {
		splice @{ $self->[1] }, $start, 0, @ki;
		splice @{ $self->[2] }, $start, 0, @vi;
	}
	@ret;
}

sub PUSH {
	my ($self) = shift;
	my ($k);
	while (@_) {
		($k, my $v) = (shift, shift);
		if (exists($self->[4][2]{ $k })) {
			${ $self->[4][2]{ $k } } = $v;
		}
		else {
			push @{ $self->[1] }, $k;
			push @{ $self->[2] }, \$v;
			$self->[4][2]{ $k } = \$v;
		}
	}
	scalar @{ $self->[2] };
}

sub UNSHIFT {
	my ($self) = shift;
	my ($k, @ki, @vi);
	while (@_) {
		($k, my $v) = (shift, shift);
		if (exists($self->[4][2]{ $k })) {
			${ $self->[4][2]{ $k } } = $v;
		}
		else {
			push @ki, $k;
			push @vi, \$v;
			$self->[4][2]{ $k } = \$v;
		}
	}
	if (scalar @ki) {
		unshift @{ $self->[1] }, @ki;
		unshift @{ $self->[2] }, @vi;
	}
	scalar @{ $self->[2] };
}

sub POP { $_[0]->DELETE($#{ $_[0]->[2] }) }
sub SHIFT { $_[0]->DELETE(0) }

#sub EXTEND { print "\tarray EXTEND($_[1])\n"; }
#sub STORESIZE { print "\tSTORESIZE\n"; }

1;

package Array::OrdHash::_hash;
#use warnings;
use strict;

sub TIEHASH {
	my $ret = bless [
		undef,		#keys ref
		undef,		#values ref
		{},			#keys - val refs
		-1,			#pointer
	], $_[0];
	$ret;
}

sub STORE {
	if (exists $_[0]->[2]{ $_[1] }) {
		${ $_[0]->[2]{ $_[1] } } = $_[2];
	}
	else {
		my $v = $_[2];
		push(@{ $_[0]->[0] }, $_[1]);
		push(@{ $_[0]->[1] }, \$v);
		$_[0]->[2]{ $_[1] } = \$v;
	}
}

sub FETCH {
	(exists $_[0]->[2]{ $_[1] }) ? ${ $_[0]->[2]{ $_[1] } } : undef;
}

sub EXISTS {
	exists $_[0]->[2]->{ $_[1] };
}

sub FIRSTKEY {
	$_[0]->[3] = 0;
	$_[0]->[0][0];
}
sub NEXTKEY {
	if ($_[0]->[3] >= $#{ $_[0]->[0] }) {
		$_[0]->[3] = -1;
		return;
	}
	$_[0]->[0][++$_[0]->[3]];
}
sub DELETE {
	return unless (exists $_[0]->[2]->{ $_[1] });
	my $ind = Array::OrdHash::_util::_keyindex($_[0]->[0], $_[1]);
	delete $_[0]->[2]{ $_[1] };
	splice(@{ $_[0]->[0] }, $ind, 1);
	[$ind, ${ splice(@{ $_[0]->[1] }, $ind, 1) }];
}
sub CLEAR {
	$_[0]->[0] = [];
	$_[0]->[1] = [];
	$_[0]->[2] = {};
	$_[0]->[3] = -1;
}
sub SCALAR   { scalar %{$_[0]->[2]} }

1;

package Array::OrdHash::_util;
use strict;

sub _keyindex {
	my $j = 0;
	foreach (@{ $_[0] }) {
		return $j if $_ eq $_[1];
		$j++;
	}
	-1;
}
#=head1 DISCLAIMER
#BECAUSE THIS SOFTWARE IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE SOFTWARE, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE SOFTWARE "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE SOFTWARE IS WITH YOU. SHOULD THE SOFTWARE PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR, OR CORRECTION.
#IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE SOFTWARE AS PERMITTED BY THE ABOVE LICENCE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE SOFTWARE (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE SOFTWARE TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.

1;

__END__