o wi(@s$ddlmZd ddZd ddZd S) )arrayFc CsT|r t||ddS||krdSt|t|}}|dkr&t|||kr&dS|dkr,|S|dkr2|S||kr@||}}||}}tdt|d}td|dD]I}||d<|d}td|dD]*} || } t||d|| dk} t|| d|| dd|| || <| }qa|dkrt||krdSqP|dkr|||krdS||S)aCompute the absolute Levenshtein distance between the two sequences `seq1` and `seq2`. The Levenshtein distance is the minimum number of edit operations necessary for transforming one sequence into the other. The edit operations allowed are: * deletion: ABC -> BC, AC, AB * insertion: ABC -> ABCD, EABC, AEBC.. * substitution: ABC -> ABE, ADC, FBC.. The `max_dist` parameter controls at which moment we should stop computing the distance between the provided sequences. If it is a negative integer, the distance will be computed until the sequences are exhausted; otherwise, the computation will stop at the moment the calculated distance is higher than `max_dist`, and then return -1. For example: >>> levenshtein("abc", "abcd", max_dist=1) # dist = 1 1 >>> levenshtein("abc", "abcde", max_dist=1) # dist = 2 -1 This can be a time saver if you're not interested in the exact distance, but only need to check if the distance between the given sequences is below a given threshold. The `normalized` parameter is here for backward compatibility; providing it will result in a call to `nlevenshtein`, which should be used directly instead. )methodrrL) nlevenshteinlenabsrrangeintmin) seq1seq2max_dist normalizedlen1len2columnxlastyoldcostrR/home/ubuntu/sommelier/.venv/lib/python3.10/site-packages/distance/_levenshtein.py levenshteins:  (rrcCs||krdSt|t|}}|dks|dkrdS||kr'||}}||}}|dkr4t||t|S|dkrs  B