6 use Test::More 'no_plan';
10 eval { Scalar::Vec::Util::veq_pp(undef, 0, my $y, 0, 0) };
11 like($@, qr/Invalid\s+argument/, 'first argument undef croaks');
12 eval { Scalar::Vec::Util::veq_pp(my $x, undef, my $y, 0, 0) };
13 like($@, qr/Invalid\s+argument/, 'second argument undef croaks');
14 eval { Scalar::Vec::Util::veq_pp(my $x, 0, undef, 0, 0) };
15 like($@, qr/Invalid\s+argument/, 'third argument undef croaks');
16 eval { Scalar::Vec::Util::veq_pp(my $x, 0, my $y, undef, 0) };
17 like($@, qr/Invalid\s+argument/, 'fourth argument undef croaks');
18 eval { Scalar::Vec::Util::veq_pp(my $x, 0, my $y, 0, undef) };
19 like($@, qr/Invalid\s+argument/, 'fifth argument undef croaks');
26 (undef, my $s, my $l, my $x) = @_;
28 vec($_[0], $_, 1) = $x for $s .. $s + $l - 1;
31 sub rst { myfill($_[0], 0, $n, 0) }
34 (undef, my $a, my $b, my $x) = @_;
35 myfill($_[0], 0, $a, $x);
36 myfill($_[0], $a, $b, 1 - $x);
37 myfill($_[0], $a + $b, $n - ($a + $b) , $x);
40 my ($v1, $v2) = ('') x 2;
42 my @s = ($p - $q) .. ($p + $q);
45 for my $l (0 .. $n - 1) {
46 last if $s1 + $l > $n or $s2 + $l > $n;
49 ok(Scalar::Vec::Util::veq_pp($v1 => $s1, $v2 => $s2, $l), "veq_pp $s1, $s2, $l");
50 ok(!Scalar::Vec::Util::veq_pp($v1 => $s1 - 1, $v2 => $s2, $l), 'not veq_pp ' . ($s1 - 1) . ", $s2, $l") if $l > 0;
51 ok(!Scalar::Vec::Util::veq_pp($v1 => $s1 + 1, $v2 => $s2, $l), 'not veq_pp ' . ($s1 + 1) . ", $s2, $l") if $l > 0;