| 1 | package Sorter::by_similarity; | ||
| 2 | |||
| 3 | 1 | ▶ | use 5.010001; |
|
Subroutine
BEGIN: called CC=1 SCAR=0.0
| |||
| 4 | 1 | ▶ | use strict; |
|
Subroutine
BEGIN: called CC=1 SCAR=0.0
| |||
| 5 | 1 | ▶ | use warnings; |
|
Subroutine
BEGIN: called CC=1 SCAR=0.0
| |||
| 6 | |||
| 7 | 0 | ▶ | use Text::Levenshtein::XS; |
|
Subroutine
BEGIN: called CC=1 SCAR=2.6
| |||
| 8 | |||
| 9 | our $AUTHORITY = 'cpan:PERLANCAR'; # AUTHORITY | ||
| 10 | our $DATE = '2024-01-24'; # DATE | ||
| 11 | our $DIST = 'Sorter-by_similarity'; # DIST | ||
| 12 | our $VERSION = '0.004'; # VERSION | ||
| 13 | |||
| 14 | sub meta { | ||
| 15 | return +{ | ||
| 16 | v => 1, | ||
| 17 | args => { | ||
| 18 | string => {schema=>'str*', req=>1}, | ||
| 19 | reverse => {schema => 'bool*'}, | ||
| 20 | ci => {schema => 'bool*'}, | ||
| 21 | }, | ||
| 22 | }; | ||
| 23 | } | ||
| 24 | |||
| 25 | sub gen_sorter { | ||
| 26 | my %args = @_; | ||
| 27 | |||
| 28 | my $reverse = $args{reverse}; | ||
| 29 | my $ci = $args{ci}; | ||
| 30 | |||
| 31 | sub { | ||
| 32 | my @items = @_; | ||
| 33 | my @distances; | ||
| 34 | if ($ci) { | ||
| 35 | @distances = map { Text::Levenshtein::XS::distance($args{string}, $_) } @items; | ||
| 36 | } else { | ||
| 37 | @distances = map { Text::Levenshtein::XS::distance(lc($args{string}), (lc $_)) } @items; | ||
| 38 | } | ||
| 39 | |||
| 40 | map { $items[$_] } sort { | ||
| 41 | ($reverse ? $distances[$b] <=> $distances[$a] : $distances[$a] <=> $distances[$b]) || | ||
| 42 | ($reverse ? $b <=> $a : $a <=> $b) | ||
| 43 | } 0 .. $#items; | ||
| 44 | }; | ||
| 45 | } | ||
| 46 | |||
| 47 | 1; | ||
| 48 | # ABSTRACT: Sort by most similar to a reference string | ||
| 49 | |||
| 50 | __END__ | ||