o 㹏ir& @sxdZddlmZddlmZmZmZmZddlm Z e dZ e dZ dZ dZdZd Zd ed ed eeeee ffd eeeee fffddZeeddZeeddZeeddZdZdZdZdZeeeeedZieeeegZeeeefededediZded ee fddZd eded e fd!d"Zd eded e fd#d$Z!d eded e fd%d&Z"d eded e fd'd(Z#d)S)*z2Module contains the score calculation algorithems.)partial)DictListUnioncast) SCORE_INDICESz-infinfg{Gztg{Gzg? char_start char_stop hash_tablereturncs6|}|fddtt|t|dD|S)aGenerate index mapping for `bonus` calculation. Args: char_start: Starting char of the range. char_stop: Ending char of the range. value: Value to give to the range of char. hash_table: Base dictionary to add the mapping. Returns: A dictionary containing the given range with provided index. Examples: >>> _char_range_with("a", "d", 1, {}) {'a': 1, 'b': 1, 'c': 1, 'd': 1} c3s|] }t|fVqdS)N)chr).0uni_charvalueG/home/ubuntu/veenaModal/venv/lib/python3.10/site-packages/pfzy/score.py "s  z#_char_range_with..)copyupdaterangeord)r r rr rrr_char_range_withs razAZ09g?g?gffffff?g333333?)/-_ .rhaystackcCs8d}g}|D]}|tt|d|d|}q|S)aCalculate bonus score for the given haystack. The bonus are applied to each char based on the previous char. When previous char is within the `BONUS_MAP` then additional bonus are applied to the current char due to it might be the start of a new word. When encountered a mix case character, if the current char is capitalised then if the previous char is normal case or within `BONUS_MAP`, additional bounus are applied. Args: haystack: String to calculate bonus. Returns: A list of float matching the length of the given haystack with each index representing the bonus score to apply. Examples: >>> _bonus("asdf") [0.9, 0, 0, 0] >>> _bonus("asdf asdf") [0.9, 0, 0, 0, 0, 0.8, 0, 0, 0] >>> _bonus("asdf aSdf") [0.9, 0, 0, 0, 0, 0.8, 0.7, 0, 0] >>> _bonus("asdf/aSdf") [0.9, 0, 0, 0, 0, 0.9, 0.7, 0, 0] r!r)append BONUS_STATES BONUS_INDEXget)r' prev_charbonuscharrrr_bonus<s r/needlec sHt|t|}t|}|r|}|dks|kr%ttt|fSfddt|D}fddt|D}t|D]o}t}||dkrKtnt }tD]\} |||| krt} |dkrj| t || } n| dkrt ||d| d|| ||d| dt } | ||| <t | ||||| <}qQt||| <||||| <}qQq?|dd}} d} ddt|D} |dkr| dkr| s||| ||| kr||| tkr|dko| dko||| ||d| dt k} | | |<| d8} n| d8} | dks|d8}|dks||dd| fS)afUse fzy logic to calculate score for `needle` within the given `haystack`. 2 2D array to track the score. 1. The running score (`running_score`) which represents the best score for the current position. 2. The result score (`result_score`) which tracks to overall best score that could be for the current positon. With every consequtive match, additional bonuse score are given and for every non matching char, a negative gap score is applied. After the score is calculated, the final matching score will be stored at the last position of the `result_score`. Backtrack the result by comparing the 2 2D array to find the corresponding indices. Args: needle: Substring to find in haystack. haystack: String to be searched and scored. Returns: A tuple of matching score with a list of matching indices. rcg|] }ddtDqS)cSg|]}dqSrrrr#rrr %_score...rr4 haystack_lenrrr5z_score..cr1)cSr2r3rr4rrrr5r6r7r8r4r9rrr5r;rFcSr2r3rr4rrrr5r6) lenr/islowerlower SCORE_MAXlistr SCORE_MINSCORE_GAP_TRAILINGSCORE_GAP_INNERSCORE_GAP_LEADINGmaxSCORE_MATCH_CONSECUTIVE) r0r' needle_len bonus_score running_score result_scorei prev_score gap_scorejscorematch_requiredindicesrr9r_scoreasl         rRcCsJ||}}|s dSd}|D]}|||d}|dkr"dSqdS)aCheck if needle is subsequence of haystack. Args: needle: Substring to find in haystack. haystack: String to be searched and scored. Returns: Boolean indicating if `needle` is subsequence of `haystack`. Examples: >>> _subsequence("as", "bbwi") False >>> _subsequence("as", "bbaiws") True >>> _subsequence("sa", "bbaiws") False TrrF)r>find)r0r'offsetr.rrr _subsequencesrUcCst||r t||StdfS)aUse fzy matching algorithem to match needle against haystack. Note: The `fzf` unordered search is not supported for performance concern. When the provided `needle` is not a subsequence of `haystack` at all, then `(-inf, None)` is returned. See Also: https://github.com/jhawthorn/fzy/blob/master/src/match.c Args: needle: Substring to find in haystack. haystack: String to be searched and scored against. Returns: A tuple of matching score with a list of matching indices. Examples: >>> fzy_scorer("ab", "acb") (0.89, [0, 2]) >>> fzy_scorer("ab", "acbabc") (0.98, [3, 4]) >>> fzy_scorer("ab", "wc") (-inf, None) N)rUrRrA)r0r'rrr fzy_scorers  rVcCsg}d}||}}|dD]'}|sq|||}|dkr'tdfSt|}|t|||||7}q|s@d|fS|dd|d d|ddd|dd|fS)aUMatch needle against haystack using :meth:`str.find`. Note: Scores may be negative but the higher the score, the higher the match rank. `-inf` score means no match found. See Also: https://github.com/aslpavel/sweep.py/blob/3f4a179b708059c12b9e5d76d1eb3c70bf2caadc/sweep.py#L837 Args: needle: Substring to find in haystack. haystack: String to be searched and scored against. Returns: A tuple of matching score with a list of matching indices. Example: >>> substr_scorer("ab", "awsab") (-1.3, [3, 4]) >>> substr_scorer("ab", "abc") (0.5, [0, 1]) >>> substr_scorer("ab", "iop") (-inf, None) >>> substr_scorer("ab", "asdafswabc") (-1.6388888888888888, [7, 8]) >>> substr_scorer(" ", "asdf") (0, []) rr$Nrr&)r>splitrSrAr<extendr)r0r'rQrTrGrrr substr_scorers"   4rZN)$__doc__ functoolsrtypingrrrr pfzy.typesrfloatrAr?rDrBrCrFstrintr lower_with upper_with digit_withSCORE_MATCH_SLASHSCORE_MATCH_WORDSCORE_MATCH_CAPITALSCORE_MATCH_DOT BONUS_MAPr)r*r/rRboolrUrVrZrrrrsN     $%d