/usr/share/perl5/Catalyst/Action.pm is in libcatalyst-perl 5.90115-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 | package Catalyst::Action;
=head1 NAME
Catalyst::Action - Catalyst Action
=head1 SYNOPSIS
<form action="[%c.uri_for(c.action)%]">
$c->forward( $action->private_path );
=head1 DESCRIPTION
This class represents a Catalyst Action. You can access the object for the
currently dispatched action via $c->action. See the L<Catalyst::Dispatcher>
for more information on how actions are dispatched. Actions are defined in
L<Catalyst::Controller> subclasses.
=cut
use Moose;
use Scalar::Util 'looks_like_number', 'blessed';
use Moose::Util::TypeConstraints ();
with 'MooseX::Emulate::Class::Accessor::Fast';
use namespace::clean -except => 'meta';
has class => (is => 'rw');
has namespace => (is => 'rw');
has 'reverse' => (is => 'rw');
has attributes => (is => 'rw');
has name => (is => 'rw');
has code => (is => 'rw');
has private_path => (
reader => 'private_path',
isa => 'Str',
lazy => 1,
required => 1,
default => sub { '/'.shift->reverse },
);
has number_of_args => (
is=>'ro',
init_arg=>undef,
isa=>'Int|Undef',
required=>1,
lazy=>1,
builder=>'_build_number_of_args');
sub _build_number_of_args {
my $self = shift;
if( ! exists $self->attributes->{Args} ) {
# When 'Args' does not exist, that means we want 'any number of args'.
return undef;
} elsif(!defined($self->attributes->{Args}[0])) {
# When its 'Args' that internal cue for 'unlimited'
return undef;
} elsif(
scalar(@{$self->attributes->{Args}}) == 1 &&
looks_like_number($self->attributes->{Args}[0])
) {
# 'Old school' numbered args (is allowed to be undef as well)
return $self->attributes->{Args}[0];
} else {
# New hotness named arg constraints
return $self->number_of_args_constraints;
}
}
sub normalized_arg_number {
return $_[0]->number_of_args;
}
sub comparable_arg_number {
return defined($_[0]->number_of_args) ? $_[0]->number_of_args : ~0;
}
has number_of_args_constraints => (
is=>'ro',
isa=>'Int|Undef',
init_arg=>undef,
required=>1,
lazy=>1,
builder=>'_build_number_of_args_constraints');
sub _build_number_of_args_constraints {
my $self = shift;
return unless $self->has_args_constraints;
# If there is one constraint and its a ref, we need to decide
# if this number 'unknown' number or if the ref allows us to
# determine a length.
if(scalar @{$self->args_constraints} == 1) {
my $tc = $self->args_constraints->[0];
if(
$tc->can('is_strictly_a_type_of') &&
$tc->is_strictly_a_type_of('Tuple'))
{
my @parameters = @{ $tc->parameters||[]};
if( defined($parameters[-1]) and exists($parameters[-1]->{slurpy})) {
return undef;
} else {
return my $total_params = scalar(@parameters);
}
} elsif($tc->is_a_type_of('Ref')) {
return undef;
} else {
return 1; # Its a normal 1 arg type constraint.
}
} else {
# We need to loop through and error on ref types. We don't allow a ref type
# in the middle.
my $total = 0;
foreach my $tc( @{$self->args_constraints}) {
if($tc->is_a_type_of('Ref')) {
die "$tc is a Ref type constraint. You cannot mix Ref and non Ref type constraints in Args for action ${\$self->reverse}";
} else {
++$total;
}
}
return $total;
}
}
has args_constraints => (
is=>'ro',
init_arg=>undef,
traits=>['Array'],
isa=>'ArrayRef',
required=>1,
lazy=>1,
builder=>'_build_args_constraints',
handles => {
has_args_constraints => 'count',
args_constraint_count => 'count',
all_args_constraints => 'elements',
});
sub _build_args_constraints {
my $self = shift;
my @arg_protos = @{$self->attributes->{Args}||[]};
return [] unless scalar(@arg_protos);
return [] unless defined($arg_protos[0]);
# If there is only one arg and it looks like a number
# we assume its 'classic' and the number is the number of
# constraints.
my @args = ();
if(
scalar(@arg_protos) == 1 &&
looks_like_number($arg_protos[0])
) {
return \@args;
} else {
@args =
map { my @tc = $self->resolve_type_constraint($_); scalar(@tc) ? @tc : die "$_ is not a constraint!" }
@arg_protos;
}
return \@args;
}
has number_of_captures_constraints => (
is=>'ro',
isa=>'Int|Undef',
init_arg=>undef,
required=>1,
lazy=>1,
builder=>'_build_number_of_capture_constraints');
sub _build_number_of_capture_constraints {
my $self = shift;
return unless $self->has_captures_constraints;
# If there is one constraint and its a ref, we need to decide
# if this number 'unknown' number or if the ref allows us to
# determine a length.
if(scalar @{$self->captures_constraints} == 1) {
my $tc = $self->captures_constraints->[0];
if(
$tc->can('is_strictly_a_type_of') &&
$tc->is_strictly_a_type_of('Tuple'))
{
my @parameters = @{ $tc->parameters||[]};
if( defined($parameters[-1]) and exists($parameters[-1]->{slurpy})) {
return undef;
} else {
return my $total_params = scalar(@parameters);
}
} elsif($tc->is_a_type_of('Ref')) {
die "You cannot use CaptureArgs($tc) in ${\$self->reverse} because we cannot determined the number of its parameters";
} else {
return 1; # Its a normal 1 arg type constraint.
}
} else {
# We need to loop through and error on ref types. We don't allow a ref type
# in the middle.
my $total = 0;
foreach my $tc( @{$self->captures_constraints}) {
if($tc->is_a_type_of('Ref')) {
die "$tc is a Ref type constraint. You cannot mix Ref and non Ref type constraints in CaptureArgs for action ${\$self->reverse}";
} else {
++$total;
}
}
return $total;
}
}
has captures_constraints => (
is=>'ro',
init_arg=>undef,
traits=>['Array'],
isa=>'ArrayRef',
required=>1,
lazy=>1,
builder=>'_build_captures_constraints',
handles => {
has_captures_constraints => 'count',
captures_constraints_count => 'count',
all_captures_constraints => 'elements',
});
sub _build_captures_constraints {
my $self = shift;
my @arg_protos = @{$self->attributes->{CaptureArgs}||[]};
return [] unless scalar(@arg_protos);
return [] unless defined($arg_protos[0]);
# If there is only one arg and it looks like a number
# we assume its 'classic' and the number is the number of
# constraints.
my @args = ();
if(
scalar(@arg_protos) == 1 &&
looks_like_number($arg_protos[0])
) {
return \@args;
} else {
@args =
map { my @tc = $self->resolve_type_constraint($_); scalar(@tc) ? @tc : die "$_ is not a constraint!" }
@arg_protos;
}
return \@args;
}
sub resolve_type_constraint {
my ($self, $name) = @_;
if(defined($name) && blessed($name) && $name->can('check')) {
# Its already a TC, good to go.
return $name;
}
# This is broken for when there is more than one constraint
if($name=~m/::/) {
eval "use Type::Registry; 1" || die "Can't resolve type constraint $name without installing Type::Tiny";
my $tc = Type::Registry->new->foreign_lookup($name);
return defined $tc ? $tc : die "'$name' not a full namespace type constraint in ${\$self->private_path}";
}
my @tc = grep { defined $_ } (eval("package ${\$self->class}; $name"));
unless(scalar @tc) {
# ok... so its not defined in the package. we need to look at all the roles
# and superclasses, look for attributes and figure it out.
# Superclasses take precedence;
my @supers = $self->class->can('meta') ? map { $_->meta } $self->class->meta->superclasses : ();
my @roles = $self->class->can('meta') ? $self->class->meta->calculate_all_roles : ();
# So look through all the super and roles in order and return the
# first type constraint found. We should probably find all matching
# type constraints and try to do some sort of resolution.
foreach my $parent (@roles, @supers) {
if(my $m = $parent->get_method($self->name)) {
if($m->can('attributes')) {
my ($key, $value) = map { $_ =~ /^(.*?)(?:\(\s*(.+?)\s*\))?$/ }
grep { $_=~/^Args\(/ or $_=~/^CaptureArgs\(/ }
@{$m->attributes};
next unless $value eq $name;
my @tc = eval "package ${\$parent->name}; $name";
if(scalar(@tc)) {
return map { ref($_) ? $_ : Moose::Util::TypeConstraints::find_or_parse_type_constraint($_) } @tc;
} else {
return;
}
}
}
}
my $classes = join(',', $self->class, @roles, @supers);
die "'$name' not a type constraint in '${\$self->private_path}', Looked in: $classes";
}
if(scalar(@tc)) {
return map { ref($_) ? $_ : Moose::Util::TypeConstraints::find_or_parse_type_constraint($_) } @tc;
} else {
return;
}
}
has number_of_captures => (
is=>'ro',
init_arg=>undef,
isa=>'Int',
required=>1,
lazy=>1,
builder=>'_build_number_of_captures');
sub _build_number_of_captures {
my $self = shift;
if( ! exists $self->attributes->{CaptureArgs} ) {
# If there are no defined capture args, thats considered 0.
return 0;
} elsif(!defined($self->attributes->{CaptureArgs}[0])) {
# If you fail to give a defined value, that's also 0
return 0;
} elsif(
scalar(@{$self->attributes->{CaptureArgs}}) == 1 &&
looks_like_number($self->attributes->{CaptureArgs}[0])
) {
# 'Old school' numbered captures
return $self->attributes->{CaptureArgs}[0];
} else {
# New hotness named arg constraints
return $self->number_of_captures_constraints;
}
}
use overload (
# Stringify to reverse for debug output etc.
q{""} => sub { shift->{reverse} },
# Codulate to execute to invoke the encapsulated action coderef
'&{}' => sub { my $self = shift; sub { $self->execute(@_); }; },
# Make general $stuff still work
fallback => 1,
);
no warnings 'recursion';
sub dispatch { # Execute ourselves against a context
my ( $self, $c ) = @_;
return $c->execute( $self->class, $self );
}
sub execute {
my $self = shift;
$self->code->(@_);
}
sub match {
my ( $self, $c ) = @_;
return $self->match_args($c, $c->req->args);
}
sub match_args {
my ($self, $c, $args) = @_;
my @args = @{$args||[]};
# There there are arg constraints, we must see to it that the constraints
# check positive for each arg in the list.
if($self->has_args_constraints) {
# If there is only one type constraint, and its a Ref or subtype of Ref,
# That means we expect a reference, so use the full args arrayref.
if(
$self->args_constraint_count == 1 &&
(
$self->args_constraints->[0]->is_a_type_of('Ref') ||
$self->args_constraints->[0]->is_a_type_of('ClassName')
)
) {
# Ok, the the type constraint is a ref type, which is allowed to have
# any number of args. We need to check the arg length, if one is defined.
# If we had a ref type constraint that allowed us to determine the allowed
# number of args, we need to match that number. Otherwise if there was an
# undetermined number (~0) then we allow all the args. This is more of an
# Optimization since Tuple[Int, Int] would fail on 3,4,5 anyway, but this
# way we can avoid calling the constraint when the arg length is incorrect.
if(
$self->comparable_arg_number == ~0 ||
scalar( @args ) == $self->comparable_arg_number
) {
return $self->args_constraints->[0]->check($args);
} else {
return 0;
}
# Removing coercion stuff for the first go
#if($self->args_constraints->[0]->coercion && $self->attributes->{Coerce}) {
# my $coerced = $self->args_constraints->[0]->coerce($c) || return 0;
# $c->req->args([$coerced]);
# return 1;
#}
} else {
# Because of the way chaining works, we can expect args that are totally not
# what you'd expect length wise. When they don't match length, thats a fail
return 0 unless scalar( @args ) == $self->comparable_arg_number;
for my $i(0..$#args) {
$self->args_constraints->[$i]->check($args[$i]) || return 0;
}
return 1;
}
} else {
# If infinite args with no constraints, we always match
return 1 if $self->comparable_arg_number == ~0;
# Otherwise, we just need to match the number of args.
return scalar( @args ) == $self->comparable_arg_number;
}
}
sub match_captures {
my ($self, $c, $captures) = @_;
my @captures = @{$captures||[]};
return 1 unless scalar(@captures); # If none, just say its ok
return $self->has_captures_constraints ?
$self->match_captures_constraints($c, $captures) : 1;
return 1;
}
sub match_captures_constraints {
my ($self, $c, $captures) = @_;
my @captures = @{$captures||[]};
# Match is positive if you don't have any.
return 1 unless $self->has_captures_constraints;
if(
$self->captures_constraints_count == 1 &&
(
$self->captures_constraints->[0]->is_a_type_of('Ref') ||
$self->captures_constraints->[0]->is_a_type_of('ClassName')
)
) {
return $self->captures_constraints->[0]->check($captures);
} else {
for my $i(0..$#captures) {
$self->captures_constraints->[$i]->check($captures[$i]) || return 0;
}
return 1;
}
}
sub compare {
my ($a1, $a2) = @_;
return $a1->comparable_arg_number <=> $a2->comparable_arg_number;
}
sub scheme {
return exists $_[0]->attributes->{Scheme} ? $_[0]->attributes->{Scheme}[0] : undef;
}
sub list_extra_info {
my $self = shift;
return {
Args => $self->normalized_arg_number,
CaptureArgs => $self->number_of_captures,
}
}
__PACKAGE__->meta->make_immutable;
1;
__END__
=head1 METHODS
=head2 attributes
The sub attributes that are set for this action, like Local, Path, Private
and so on. This determines how the action is dispatched to.
=head2 class
Returns the name of the component where this action is defined.
Derived by calling the L<catalyst_component_name|Catalyst::Component/catalyst_component_name>
method on each component.
=head2 code
Returns a code reference to this action.
=head2 dispatch( $c )
Dispatch this action against a context.
=head2 execute( $controller, $c, @args )
Execute this action's coderef against a given controller with a given
context and arguments
=head2 match( $c )
Check Args attribute, and makes sure number of args matches the setting.
Always returns true if Args is omitted.
=head2 match_captures ($c, $captures)
Can be implemented by action class and action role authors. If the method
exists, then it will be called with the request context and an array reference
of the captures for this action.
Returning true from this method causes the chain match to continue, returning
makes the chain not match (and alternate, less preferred chains will be attempted).
=head2 match_captures_constraints ($c, \@captures);
Does the \@captures given match any constraints (if any constraints exist). Returns
true if you ask but there are no constraints.
=head2 match_args($c, $args)
Does the Args match or not?
=head2 resolve_type_constraint
Tries to find a type constraint if you have on on a type constrained method.
=head2 compare
Compares 2 actions based on the value of the C<Args> attribute, with no C<Args>
having the highest precedence.
=head2 namespace
Returns the private namespace this action lives in.
=head2 reverse
Returns the private path for this action.
=head2 private_path
Returns absolute private path for this action. Unlike C<reverse>, the
C<private_path> of an action is always suitable for passing to C<forward>.
=head2 name
Returns the sub name of this action.
=head2 number_of_args
Returns the number of args this action expects. This is 0 if the action doesn't
take any arguments and undef if it will take any number of arguments.
=head2 normalized_arg_number
The number of arguments (starting with zero) that the current action defines, or
undefined if there is not defined number of args (which is later treated as, "
as many arguments as you like").
=head2 comparable_arg_number
For the purposes of comparison we normalize 'number_of_args' so that if it is
undef we mean ~0 (as many args are we can think of).
=head2 number_of_captures
Returns the number of captures this action expects for L<Chained|Catalyst::DispatchType::Chained> actions.
=head2 list_extra_info
A HashRef of key-values that an action can provide to a debugging screen
=head2 scheme
Any defined scheme for the action
=head2 meta
Provided by Moose.
=head1 AUTHORS
Catalyst Contributors, see Catalyst.pm
=head1 COPYRIGHT
This library is free software. You can redistribute it and/or modify it under
the same terms as Perl itself.
=cut
|