10 our @EXPORT_OK = qw(rangematch);
13 my ($class, $values) = @_;
14 bless [sort map { s/[^a-z]/./g; $_ } @$values], $class;
19 my $options = shift || {};
20 my $pagesize = $options->{pagesize} || 50;
21 my $context = $options->{context } // 1 + ($pagesize >> 4);
22 my $length = $options->{length } || 4;
23 my $pages = $options->{pages } || 1 + int $#$self / $pagesize;
25 $pagesize = @$self / $pages;
28 while ($offset < @$self) {
29 my $link = substr $self->[$offset], 0, $length;
32 my $before = $offset > $context ? $self->[$offset - $context] : '';
33 for my $match (split //, $before) {
34 scalar $link =~ /\G\Q$match/g or last;
37 substr($link, $trim) = '' unless $trim > length $link;
44 for my $i (0 .. $#links - 1) {
45 my ($link, $lastchar) = $links[$i + 1]->[0] =~ /(.*)(.)/;
46 $link .= $lastchar eq '.' ? 'z' : chr( ord($lastchar) - 1 )
47 unless $lastchar eq 'a';
48 $links[$i]->[1] = $link;
57 my ($s1, $s2) = $link =~ /([^-]*) - ([^-]*)/x
58 or return qr/^\Q$link/i;
64 for my $i (0 .. length($s1) - 1) {
65 $c1 = substr $s1, $i, 1;
66 my $c2 = length $s2 <= $i ? undef : substr $s2, $i, 1;
67 my $next = $i + 1 >= length($s1) ? $c1 : chr( ord($c1) + 1 );
68 my $last = defined $c2 && $i == 0 ? chr( ord($c2) - (length $s2 > 1) ) : 'z';
69 $next le $last or next if defined $c2;
70 push @allow, $prefix."[$next-$last]";
79 for my $i (0 .. length($s2) - 1) {
80 my $c1 = length $s1 <= $i ? undef : substr $s1, $i, 1;
81 my $c2 = substr $s2, $i, 1;
83 push @allow, "$prefix(?![$c2-$last])"
88 unless length $s1 > length $s2 or length $s1 != 0 && length $s2 == 1; #TODO
91 my $match = sprintf @allow <= 1 ? '%s' : '(?:%s)', join('|', @allow);
101 List::Index - Paginate alphabetic entries by finding minimal prefixes
106 my $index = List::Index->new(\@values);
107 my @pages = $index->ranges({pagesize => 50});
108 printf '<a href="?start=%s&end=%s">%1$s</a> ', @$_ for @pages;
116 L<List::Maker|List::Maker> for complex ranges of numeric lists.
120 Mischa POSLAWSKY <perl@shiar.org>
124 Copyright. All rights reserved.