X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?p=catagits%2FCatalyst-Runtime.git;a=blobdiff_plain;f=lib%2FCatalyst%2FDispatchType%2FPath.pm;h=56c1083632ffabc24e98b38088157f6aa62a3583;hp=d832dce9adba9aa62bb5410b76845e166abfc5da;hb=536bee890cf24e0e4bcda7562e7b70cc03ca0620;hpb=1cf0345be8d7bf7cd33467da529885068db2b710 diff --git a/lib/Catalyst/DispatchType/Path.pm b/lib/Catalyst/DispatchType/Path.pm index d832dce..56c1083 100644 --- a/lib/Catalyst/DispatchType/Path.pm +++ b/lib/Catalyst/DispatchType/Path.pm @@ -1,9 +1,21 @@ package Catalyst::DispatchType::Path; -use strict; -use base qw/Catalyst::DispatchType/; +use Moose; +extends 'Catalyst::DispatchType'; + use Text::SimpleTable; +use Catalyst::Utils; use URI; +use Scalar::Util (); + +has _paths => ( + is => 'rw', + isa => 'HashRef', + required => 1, + default => sub { +{} }, + ); + +no Moose; =head1 NAME @@ -11,10 +23,21 @@ Catalyst::DispatchType::Path - Path DispatchType =head1 SYNOPSIS -See L. +See L. =head1 DESCRIPTION +Dispatch type managing full path matching behaviour. For more information on +dispatch types, see: + +=over 4 + +=item * L for how they affect application authors + +=item * L for implementation information. + +=back + =head1 METHODS =head2 $self->list($c) @@ -25,15 +48,28 @@ Debug output for Path dispatch points sub list { my ( $self, $c ) = @_; - my $paths = Text::SimpleTable->new( [ 35, 'Path' ], [ 36, 'Private' ] ); - foreach my $path ( sort keys %{ $self->{paths} } ) { + my $column_width = Catalyst::Utils::term_width() - 35 - 9; + my $paths = Text::SimpleTable->new( + [ 35, 'Path' ], [ $column_width, 'Private' ] + ); + foreach my $path ( sort keys %{ $self->_paths } ) { my $display_path = $path eq '/' ? $path : "/$path"; - foreach my $action ( @{ $self->{paths}->{$path} } ) { + foreach my $action ( @{ $self->_paths->{$path} } ) { $paths->row( $display_path, "/$action" ); } } $c->log->debug( "Loaded Path actions:\n" . $paths->draw . "\n" ) - if ( keys %{ $self->{paths} } ); + if ( keys %{ $self->_paths } ); +} + +sub _action_args_sort_order { + my ( $self, $action ) = @_; + + my ($args) = @{ $action->attributes->{Args} || [] }; + + return $args if Scalar::Util::looks_like_number($args); + + return ~0; } =head2 $self->match( $c, $path ) @@ -47,9 +83,14 @@ first action that matches, if any; if not, returns 0. sub match { my ( $self, $c, $path ) = @_; - $path ||= '/'; + $path = '/' if !defined $path || !length $path; + + # sort from least args to most + my @actions = sort { $self->_action_args_sort_order($a) <=> + $self->_action_args_sort_order($b) } + @{ $self->_paths->{$path} || [] }; - foreach my $action ( @{ $self->{paths}->{$path} || [] } ) { + foreach my $action ( @actions ) { next unless $action->match($c); $c->req->action($path); $c->req->match($path); @@ -90,7 +131,7 @@ sub register_path { $path = '/' unless length $path; $path = URI->new($path)->canonical; - unshift( @{ $self->{paths}{$path} ||= [] }, $action); + unshift( @{ $self->_paths->{$path} ||= [] }, $action); return 1; } @@ -118,16 +159,17 @@ sub uri_for_action { } } -=head1 AUTHOR +=head1 AUTHORS -Matt S Trout -Sebastian Riedel, C +Catalyst Contributors, see Catalyst.pm =head1 COPYRIGHT -This program is free software, you can redistribute it and/or modify it under +This library is free software. You can redistribute it and/or modify it under the same terms as Perl itself. =cut +__PACKAGE__->meta->make_immutable; + 1;