Re^2: Find Length Of Longest Ascending/Descending Sequence

nice feature :-)

How will it match data like the following?

11101234567890123411111   =>  expected result: 15
[download]

Will you need to create the pattern in <*0123456789> dynamically based on the length of the data?

Rata

Comment on Re^2: Find Length Of Longest Ascending/Descending Sequence Select or Download Code

Replies are listed 'Best First'.
Re^3: Find Length Of Longest Ascending/Descending Sequence by moritz (Cardinal) on May 10, 2011 at 09:50 UTC
Notice the repetition: `<0123456789> * <?after 9>` [download] is short for `<0123456789> [ <?after 9> <0123456789>]*` [download] So if it matches the first one, and upto 9 (that's what the `<?after 9>` checks), it tries again to start with 0. To extract the longest match, you need to collect all, and overlapping (because the last digits of an ascending sequence can be the first of a descending sequence): `my regex seq { ... } my $length = [max] $teststring.match(&seq, :g, :overlap)>>.chars;` [download] Perl 6 - second systems done right	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^3: Find Length Of Longest Ascending/Descending Sequence
by moritz (Cardinal) on May 10, 2011 at 09:50 UTC

<*0123456789> ** <?after 9>
[download]

is short for

<*0123456789> [ <?after 9> <*0123456789>]*
[download]

So if it matches the first one, and upto 9 (that's what the <?after 9> checks), it tries again to start with 0.

To extract the longest match, you need to collect all, and overlapping (because the last digits of an ascending sequence can be the first of a descending sequence):

my regex seq {
   ...
}
my $length = [max] $teststring.match(&seq, :g, :overlap)>>.chars;
[download]

Perl 6 - second systems done right

[reply]
[d/l]
[select]