1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222
|
# INTERNAL MODULE: guts for CycleTuple type from Types::Standard.
package Types::Standard::CycleTuple;
use 5.008001;
use strict;
use warnings;
BEGIN {
$Types::Standard::CycleTuple::AUTHORITY = 'cpan:TOBYINK';
$Types::Standard::CycleTuple::VERSION = '2.002001';
}
$Types::Standard::CycleTuple::VERSION =~ tr/_//d;
use Type::Tiny ();
use Types::Standard ();
use Types::TypeTiny ();
sub _croak ($;@) { require Error::TypeTiny; goto \&Error::TypeTiny::croak }
my $_Optional = Types::Standard::Optional;
my $_arr = Types::Standard::ArrayRef;
my $_Slurpy = Types::Standard::Slurpy;
no warnings;
my $cycleuniq = 0;
sub __constraint_generator {
my @params = map {
my $param = $_;
Types::TypeTiny::is_TypeTiny( $param )
or _croak(
"Parameters to CycleTuple[...] expected to be type constraints; got $param" );
$param;
} @_;
my $count = @params;
my $tuple = Types::Standard::Tuple()->of( @params );
_croak( "Parameters to CycleTuple[...] cannot be optional" )
if grep !!$_->is_strictly_a_type_of( $_Optional ), @params;
_croak( "Parameters to CycleTuple[...] cannot be slurpy" )
if grep !!$_->is_strictly_a_type_of( $_Slurpy ), @params;
sub {
my $value = shift;
return unless $_arr->check( $value );
return if @$value % $count;
my $i = 0;
while ( $i < $#$value ) {
my $tmp = [ @$value[ $i .. $i + $count - 1 ] ];
return unless $tuple->check( $tmp );
$i += $count;
}
!!1;
}
} #/ sub __constraint_generator
sub __inline_generator {
my @params = map {
my $param = $_;
Types::TypeTiny::is_TypeTiny( $param )
or _croak(
"Parameter to CycleTuple[`a] expected to be a type constraint; got $param" );
$param;
} @_;
my $count = @params;
my $tuple = Types::Standard::Tuple()->of( @params );
return unless $tuple->can_be_inlined;
sub {
$cycleuniq++;
my $v = $_[1];
my @checks = $_arr->inline_check( $v );
push @checks, sprintf(
'not(@%s %% %d)',
( $v =~ /\A\$[a-z0-9_]+\z/i ? $v : "{$v}" ),
$count,
);
push @checks, sprintf(
'do { my $cyclecount%d = 0; my $cycleok%d = 1; while ($cyclecount%d < $#{%s}) { my $cycletmp%d = [@{%s}[$cyclecount%d .. $cyclecount%d+%d]]; unless (%s) { $cycleok%d = 0; last; }; $cyclecount%d += %d; }; $cycleok%d; }',
$cycleuniq,
$cycleuniq,
$cycleuniq,
$v,
$cycleuniq,
$v,
$cycleuniq,
$cycleuniq,
$count - 1,
$tuple->inline_check( "\$cycletmp$cycleuniq" ),
$cycleuniq,
$cycleuniq,
$count,
$cycleuniq,
) if grep { $_->inline_check( '$xyz' ) ne '(!!1)' } @params;
join( ' && ', @checks );
}
} #/ sub __inline_generator
sub __deep_explanation {
my ( $type, $value, $varname ) = @_;
my @constraints =
map Types::TypeTiny::to_TypeTiny( $_ ), @{ $type->parameters };
if ( @$value % @constraints ) {
return [
sprintf(
'"%s" expects a multiple of %d values in the array', $type,
scalar( @constraints )
),
sprintf( '%d values found', scalar( @$value ) ),
];
}
for my $i ( 0 .. $#$value ) {
my $constraint = $constraints[ $i % @constraints ];
next if $constraint->check( $value->[$i] );
return [
sprintf(
'"%s" constrains value at index %d of array with "%s"', $type, $i, $constraint
),
@{
$constraint->validate_explain(
$value->[$i], sprintf( '%s->[%s]', $varname, $i )
)
},
];
} #/ for my $i ( 0 .. $#$value)
# This should never happen...
return; # uncoverable statement
} #/ sub __deep_explanation
my $label_counter = 0;
sub __coercion_generator {
my ( $parent, $child, @tuple ) = @_;
my $child_coercions_exist = 0;
my $all_inlinable = 1;
for my $tc ( @tuple ) {
$all_inlinable = 0 if !$tc->can_be_inlined;
$all_inlinable = 0 if $tc->has_coercion && !$tc->coercion->can_be_inlined;
$child_coercions_exist++ if $tc->has_coercion;
}
return unless $child_coercions_exist;
my $C = "Type::Coercion"->new( type_constraint => $child );
if ( $all_inlinable ) {
$C->add_type_coercions(
$parent => Types::Standard::Stringable {
my $label = sprintf( "CTUPLELABEL%d", ++$label_counter );
my $label2 = sprintf( "CTUPLEINNER%d", $label_counter );
my @code;
push @code, 'do { my ($orig, $return_orig, $tmp, @new) = ($_, 0);';
push @code, "$label: {";
push @code,
sprintf(
'(($return_orig = 1), last %s) if scalar(@$orig) %% %d != 0;', $label,
scalar @tuple
);
push @code, sprintf( 'my $%s = 0; while ($%s < @$orig) {', $label2, $label2 );
for my $i ( 0 .. $#tuple ) {
my $ct = $tuple[$i];
my $ct_coerce = $ct->has_coercion;
push @code, sprintf(
'do { $tmp = %s; (%s) ? ($new[$%s + %d]=$tmp) : (($return_orig=1), last %s) };',
$ct_coerce
? $ct->coercion->inline_coercion( "\$orig->[\$$label2 + $i]" )
: "\$orig->[\$$label2 + $i]",
$ct->inline_check( '$tmp' ),
$label2,
$i,
$label,
);
} #/ for my $i ( 0 .. $#tuple)
push @code, sprintf( '$%s += %d;', $label2, scalar( @tuple ) );
push @code, '}';
push @code, '}';
push @code, '$return_orig ? $orig : \\@new';
push @code, '}';
"@code";
}
);
} #/ if ( $all_inlinable )
else {
$C->add_type_coercions(
$parent => sub {
my $value = @_ ? $_[0] : $_;
if ( scalar( @$value ) % scalar( @tuple ) != 0 ) {
return $value;
}
my @new;
for my $i ( 0 .. $#$value ) {
my $ct = $tuple[ $i % @tuple ];
my $x = $ct->has_coercion ? $ct->coerce( $value->[$i] ) : $value->[$i];
return $value unless $ct->check( $x );
$new[$i] = $x;
}
return \@new;
},
);
} #/ else [ if ( $all_inlinable ) ]
return $C;
} #/ sub __coercion_generator
1;
|