File Coverage

blib/lib/Sorter/by_similarity.pm

Criterion	Covered	Total	%
statement	11	26	42.3
branch	0	8	0.0
condition			n/a
subroutine	4	7	57.1
pod	0	2	0.0
total	15	43	34.8

package Sorter::by_similarity;

use 5.010001;
use strict;
use warnings;

use Text::Levenshtein::XS;

our $AUTHORITY = 'cpan:PERLANCAR'; # AUTHORITY
our $DATE = '2024-01-24'; # DATE
our $DIST = 'Sorter-by_similarity'; # DIST
our $VERSION = '0.004'; # VERSION

sub meta {
    return +{
        v => 1,
        args => {
            string => {schema=>'str*', req=>1},
            reverse => {schema => 'bool*'},
            ci => {schema => 'bool*'},
        },
    };
}

sub gen_sorter {
    my %args = @_;

    my $reverse = $args{reverse};
    my $ci = $args{ci};

    sub {
        my @items = @_;
        my @distances;
        if ($ci) {
            @distances = map { Text::Levenshtein::XS::distance($args{string}, $_) } @items;
        } else {
            @distances = map { Text::Levenshtein::XS::distance(lc($args{string}), (lc $_)) } @items;
        }

        map { $items[$_] } sort {
            ($reverse ? $distances[$b] <=> $distances[$a] : $distances[$a] <=> $distances[$b]) ||
                ($reverse ? $b <=> $a : $a <=> $b)
            } 0 .. $#items;
    };
}

1;
# ABSTRACT: Sort by most similar to a reference string

__END__