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
|
package Path::Dispatcher::Rule::Tokens;
# ABSTRACT: predicate is a list of tokens
our $VERSION = '1.08';
use Moo;
use MooX::TypeTiny;
use Types::Standard qw(Str ArrayRef Bool);
extends 'Path::Dispatcher::Rule';
has tokens => (
is => 'ro',
isa => ArrayRef,
required => 1,
);
has delimiter => (
is => 'ro',
isa => Str,
default => ' ',
);
has case_sensitive => (
is => 'ro',
isa => Bool,
default => 1,
);
sub _match_as_far_as_possible {
my $self = shift;
my $path = shift;
my @got = $self->tokenize($path->path);
my @expected = @{ $self->tokens };
my @matched;
while (@got && @expected) {
my $expected = $expected[0];
my $got = $got[0];
last unless $self->_match_token($got, $expected);
push @matched, $got;
shift @expected;
shift @got;
}
return (\@matched, \@got, \@expected);
}
sub _match {
my $self = shift;
my $path = shift;
my ($matched, $got, $expected) = $self->_match_as_far_as_possible($path);
return if @$expected; # didn't provide everything necessary
return if @$got && !$self->prefix; # had tokens left over
my $leftover = $self->untokenize(@$got);
return if !$matched;
return {
positional_captures => $matched,
leftover => $leftover,
};
}
sub complete {
my $self = shift;
my $path = shift;
my ($matched, $got, $expected) = $self->_match_as_far_as_possible($path);
return if @$got > 1; # had tokens leftover
return if !@$expected; # consumed all tokens
my $next = shift @$expected;
my $part = @$got ? shift @$got : '';
my @completions;
for my $completion (ref($next) eq 'ARRAY' ? @$next : $next) {
next if ref($completion);
next unless substr($completion, 0, length($part)) eq $part;
push @completions, $self->untokenize(@$matched, $completion);
}
return @completions;
}
sub _each_token {
my $self = shift;
my $got = shift;
my $expected = shift;
my $callback = shift;
if (ref($expected) eq 'ARRAY') {
for my $alternative (@$expected) {
$self->_each_token($got, $alternative, $callback);
}
}
elsif (!ref($expected) || ref($expected) eq 'Regexp') {
$callback->($got, $expected);
}
else {
die "Unexpected token '$expected'"; # the irony is not lost on me :)
}
}
sub _match_token {
my $self = shift;
my $got = shift;
my $expected = shift;
my $matched = 0;
$self->_each_token($got, $expected, sub {
my ($g, $e) = @_;
if (!ref($e)) {
($g, $e) = (lc $g, lc $e) if !$self->case_sensitive;
$matched ||= $g eq $e;
}
elsif (ref($e) eq 'Regexp') {
$matched ||= $g =~ $e;
}
});
return $matched;
}
sub tokenize {
my $self = shift;
my $path = shift;
return grep { length } split $self->delimiter, $path;
}
sub untokenize {
my $self = shift;
my @tokens = @_;
return join $self->delimiter,
grep { length }
map { split $self->delimiter, $_ }
@tokens;
}
__PACKAGE__->meta->make_immutable;
no Moo;
1;
__END__
=pod
=encoding UTF-8
=head1 NAME
Path::Dispatcher::Rule::Tokens - predicate is a list of tokens
=head1 VERSION
version 1.08
=head1 SYNOPSIS
my $rule = Path::Dispatcher::Rule::Tokens->new(
tokens => [ "comment", "show", qr/^\d+$/ ],
delimiter => '/',
block => sub { display_comment(shift->pos(3)) },
);
$rule->match("/comment/show/25");
=head1 DESCRIPTION
Rules of this class use a list of tokens to match the path.
=head1 ATTRIBUTES
=head2 tokens
Each token can be a literal string, a regular expression, or a list of either
(which are taken to mean alternations). For example, the tokens:
[ 'ticket', [ 'show', 'display' ], [ qr/^\d+$/, qr/^#\w{3}/ ] ]
first matches "ticket". Then, the next token must be "show" or "display". The
final token must be a number or a pound sign followed by three word characters.
The results are the tokens in the original string, as they were matched. If you
have three tokens, then C<< match->pos(1) >> will be the string's first token
("ticket"), C<< match->pos(2) >> its second ("display"), and C<< match->pos(3)
>> its third ("#AAA").
Capture groups inside a regex token are completely ignored.
=head2 delimiter
A string that is used to tokenize the path. The delimiter must be a string
because prefix matches use C<join> on unmatched tokens to return the leftover
path. In the future this may be extended to support having a regex delimiter.
The default is a space, but if you're matching URLs you probably want to change
this to a slash.
=head2 case_sensitive
Decide whether the rule matching is case sensitive. Default is 1, case
sensitive matching.
=head1 SUPPORT
Bugs may be submitted through L<the RT bug tracker|https://rt.cpan.org/Public/Dist/Display.html?Name=Path-Dispatcher>
(or L<bug-Path-Dispatcher@rt.cpan.org|mailto:bug-Path-Dispatcher@rt.cpan.org>).
=head1 AUTHOR
Shawn M Moore, C<< <sartak at bestpractical.com> >>
=head1 COPYRIGHT AND LICENSE
This software is copyright (c) 2020 by Shawn M Moore.
This is free software; you can redistribute it and/or modify it under
the same terms as the Perl 5 programming language system itself.
=cut
|