X-Git-Url: http://git.vpit.fr/?a=blobdiff_plain;f=lib%2FScalar%2FVec%2FUtil.pm;h=802f1c30905daaa5dbbff98453c1699a35eedd3f;hb=7e1c1e73ac4f734a019405602307430ddfe2d196;hp=db6adba1de6489b764f298bc60f314ce393935a5;hpb=2506fbb7b9572d1dfbd5e776b236977c23d648dc;p=perl%2Fmodules%2FScalar-Vec-Util.git diff --git a/lib/Scalar/Vec/Util.pm b/lib/Scalar/Vec/Util.pm index db6adba..802f1c3 100644 --- a/lib/Scalar/Vec/Util.pm +++ b/lib/Scalar/Vec/Util.pm @@ -3,7 +3,7 @@ package Scalar::Vec::Util; use strict; use warnings; -use Carp qw/croak/; +use Carp qw; =head1 NAME @@ -11,13 +11,13 @@ Scalar::Vec::Util - Utility routines for vec strings. =head1 VERSION -Version 0.05 +Version 0.07 =cut our $VERSION; BEGIN { - $VERSION = '0.05'; + $VERSION = '0.07'; eval { require XSLoader; XSLoader::load(__PACKAGE__, $VERSION); @@ -33,7 +33,7 @@ BEGIN { =head1 SYNOPSIS - use Scalar::Vec::Util qw/vfill vcopy veq/; + use Scalar::Vec::Util qw; my $s; vfill $s, 0, 100, 1; # Fill with 100 bits 1 starting at 0. @@ -72,17 +72,22 @@ Grows C<$vec> if necessary. =cut -sub _alldef { - for (@_) { return 0 unless defined } - return 1; -} - -sub vfill_pp { - (undef, my $s, my $l, my $x) = @_; - croak "Invalid argument" unless _alldef @_; +sub vfill_pp ($$$$) { + my ($s, $l, $x) = @_[1 .. 3]; return unless $l; - $x = 1 if $x; - vec($_[0], $_, 1) = $x for $s .. $s + $l - 1; + croak 'Invalid negative offset' if $s < 0; + croak 'Invalid negative length' if $l < 0; + $x = ~0 if $x; + my $SIZE = 32; + my $t = int($s / $SIZE) + 1; + my $u = int(($s + $l) / $SIZE); + if ($SIZE * $t < $s + $l) { # implies $t <= $u + vec($_[0], $_, 1) = $x for $s .. $SIZE * $t - 1; + vec($_[0], $_, $SIZE) = $x for $t .. $u - 1; + vec($_[0], $_, 1) = $x for $SIZE * $u .. $s + $l - 1; + } else { + vec($_[0], $_, 1) = $x for $s .. $s + $l - 1; + } } =head2 C<< vcopy $from => $from_start, $to => $to_start, $length >> @@ -94,18 +99,85 @@ Doesn't need to allocate any extra memory. =cut -sub vcopy_pp { +sub vcopy_pp ($$$$$) { my ($fs, $ts, $l) = @_[1, 3, 4]; - croak "Invalid argument" unless _alldef @_; return unless $l; + croak 'Invalid negative offset' if $fs < 0 or $ts < 0; + croak 'Invalid negative length' if $l < 0; my $step = $ts - $fs; - if ($step <= 0) { + if ($step <= 0) { vec($_[2], $_ + $step, 1) = vec($_[0], $_, 1) for $fs .. $fs + $l - 1; } else { # There's a risk of overwriting if $_[0] and $_[2] are the same SV. vec($_[2], $_ + $step, 1) = vec($_[0], $_, 1) for reverse $fs .. $fs + $l - 1; } } +=head2 C<< vshift $v, $start, $length => $bits [, $insert ] >> + +In the area starting at C<$start> and of length C<$length> in C<$v>, shift bits C positions left if C<< $bits > 0 >> and right otherwise. +If C<$insert> is defined, also fills the resulting gap with ones if C<$insert> is true and zeros if it's false. +Bits outside of the specified area are left untouched. +Doesn't need to allocate any extra memory. + +=cut + +sub vshift ($$$$;$) { + my ($start, $length, $bits, $insert) = @_[1 .. 4]; + return unless $length and $bits; + croak 'Invalid negative offset' if $start < 0; + croak 'Invalid negative length' if $length < 0; + my $left = 1; + if ($bits < 0) { + $left = 0; + $bits = -$bits; + } + if ($bits < $length) { + $length -= $bits; + if ($left) { + vcopy($_[0], $start, $_[0], $start + $bits, $length); + vfill($_[0], $start, $bits, $insert) if defined $insert; + } else { + vcopy($_[0], $start + $bits, $_[0], $start, $length); + vfill($_[0], $start + $length, $bits, $insert) if defined $insert; + } + } else { + vfill($_[0], $start, $length, $insert) if defined $insert; + } +} + +=head2 C<< vrot $v, $start, $length, $bits >> + +In the area starting at C<$start> and of length C<$length> in C<$v>, rotates bits C positions left if C<< $bits > 0 >> and right otherwise. +Bits outside of the specified area are left untouched. +Currently allocates an extra buffer of size C. + +=cut + +sub vrot ($$$$) { + my ($start, $length, $bits) = @_[1 .. 3]; + return unless $length and $bits; + croak 'Invalid negative offset' if $start < 0; + croak 'Invalid negative length' if $length < 0; + my $left = 1; + if ($bits < 0) { + $left = 0; + $bits = -$bits; + } + $bits %= $length; + return unless $bits; + $length -= $bits; + my $buf = ''; + if ($left) { + vcopy($_[0], $start + $length, $buf, 0, $bits); + vcopy($_[0], $start, $_[0], $start + $bits, $length); + vcopy($buf, 0, $_[0], $start, $bits); + } else { + vcopy($_[0], $start, $buf, 0, $bits); + vcopy($_[0], $start + $bits, $_[0], $start, $length); + vcopy($buf, 0, $_[0], $start + $length, $bits); + } +} + =head2 C<< veq $v1 => $v1_start, $v2 => $v2_start, $length >> Returns true if the C<$length> bits starting at C<$v1_start> in C<$v1> and C<$v2_start> in C<$v2> are equal, and false otherwise. @@ -113,9 +185,10 @@ If needed, C<$length> is decreased to fit inside C<$v1> and C<$v2> boundaries. =cut -sub veq_pp { +sub veq_pp ($$$$$) { my ($s1, $s2, $l) = @_[1, 3, 4]; - croak "Invalid argument" unless _alldef @_; + croak 'Invalid negative offset' if $s1 < 0 or $s2 < 0; + croak 'Invalid negative length' if $l < 0; my $i = 0; while ($i < $l) { return 0 if vec($_[0], $s1 + $i, 1) != vec($_[2], $s2 + $i, 1); @@ -126,7 +199,7 @@ sub veq_pp { =head1 EXPORT -The functions L, L and L are only exported on request. +The functions L, L, L, L and L are only exported on request. All of them are exported by the tags C<':funcs'> and C<':all'>. The constants L and L are also only exported on request. @@ -134,12 +207,12 @@ They are all exported by the tags C<':consts'> and C<':all'>. =cut -use base qw/Exporter/; +use base qw; our @EXPORT = (); our %EXPORT_TAGS = ( - 'funcs' => [ qw/vfill vcopy veq/ ], - 'consts' => [ qw/SVU_PP SVU_SIZE/ ] + 'funcs' => [ qw ], + 'consts' => [ qw ] ); our @EXPORT_OK = map { @$_ } values %EXPORT_TAGS; $EXPORT_TAGS{'all'} = [ @EXPORT_OK ]; @@ -230,6 +303,11 @@ I'll add exceptions for them. =head1 DEPENDENCIES +L 5.6. + +A C compiler. +This module may happen to build with a C++ compiler as well, but don't rely on it, as no guarantee is made in this regard. + L, L (core modules since perl 5), L (since perl 5.006). =head1 SEE ALSO @@ -257,7 +335,7 @@ Tests code coverage report is available at L