§ ïžîdâ ãó\—UdZddlmZddlmZmZddlmZddlm Z  ddd „Z ddd „Z ddd „Z ddd„Zde iZded<de iZded<de iZded<deiZded<dZe ede¬¦«Ze ede¬¦«Ze ede¬¦«Ze ede¬¦«Ze ed¦«Ze ed¦«ZdS) zæ The Levenshtein (edit) distance is a string metric to measure the difference between two strings/sequences s1 and s2. It's defined as the minimum number of insertions, deletions or substitutions required to transform s1 into s2. é)Ú annotations)ÚAnyÚCallable)Ú ScorerFlag)Úfallback_import©ér r Úweightsútuple[int, int, int] | NoneÚreturnúdict[str, Any]cól—tj}||d|dkr|tjz}dd|dœS©Nrr lÿÿÿÿ©Ú optimal_scoreÚ worst_scoreÚflags©Ú _ScorerFlagÚ RESULT_I64Ú SYMMETRIC©r rs úb/home/feoh/.local/pipx/venvs/poetry/lib/python3.11/site-packages/rapidfuzz/distance/Levenshtein.pyÚ_get_scorer_flags_distancersJ€õ Ô "€EØ€˜' !œ*¨°¬ Ò2Ð2Ø •Ô&Ñ&ˆðØ Øð ð ðócól—tj}||d|dkr|tjz}dd|dœSrrrs rÚ_get_scorer_flags_similarityr sJ€õ Ô "€EØ€˜' !œ*¨°¬ Ò2Ð2Ø •Ô&Ñ&ˆð#ØØð ð ðrcól—tj}||d|dkr|tjz}dd|dœS©Nrr r©rÚ RESULT_F64rrs rÚ%_get_scorer_flags_normalized_distancer".ó@€õ Ô "€EØ€˜' !œ*¨°¬ Ò2Ð2Ø •Ô&Ñ&ˆà¨q¸5Ð AÐ AÐArcól—tj}||d|dkr|tjz}dd|dœSrr rs rÚ'_get_scorer_flags_normalized_similarityr%8r#rÚget_scorer_flagsz(dict[str, Callable[..., dict[str, Any]]]Ú _dist_attrÚ _sim_attrÚ_norm_dist_attrÚ_norm_sim_attrzrapidfuzz.distance.LevenshteinÚdistance)Úcached_scorer_callÚ similarityÚnormalized_distanceÚnormalized_similarityÚeditopsÚopcodesN)r)r r r r )Ú__doc__Ú __future__rÚtypingrrÚrapidfuzz._utilsrrrÚ_fallback_importrrr"r%r'Ú__annotations__r(r)r*Ú_modr+r-r.r/r0r1©rrúr:sððððð#Ð"Ð"Ð"Ð"Ð"à Ð Ð Ð Ð Ð Ð Ð à6Ð6Ð6Ð6Ð6Ð6Ø@Ð@Ð@Ð@Ð@Ð@ð,5ð ð ð ð ð ð,5ð ð ð ð ð ð,5ðBðBðBðBðBð,5ðBðBðBðBðBðÐ2ð8€ ðððñðÐ4ð7€ ðððñðÐ=ð=€ðððñðÐ?ð<€ðððñð(€Ø Ð ˜D *ÀÐ LÑ LÔ L€Ø Ð ˜d LÀYÐ OÑ OÔ O€ Ø&Ð&ØÐ °OðñôÐð)Ð(ØÐ !°nðñôÐð Ð ˜4 Ñ +Ô +€Ø Ð ˜4 Ñ +Ô +€€€r