+ ʇik|^RIHt^RIHt^RIHtHtRtRRRR/RltRRRR/R lt RRRR/R lt RRRR/R lt R#) ) annotations)conv_sequences)is_none setupPandascV'g \V4#^\V4,^, p^p^p^p\V4p^\V4^, ,p/pVPp ^p VFp V !V ^4V ,W&V ^,p K VFp V !V ^4p V(V ,^,V,pW,V,V, V ,V,pWN,pW4V,(,pWB,pWoV,^8g, pVVV,^8g,pV^,^,pV^,pVWO,(,pW,pT pK V#))lenget)s1s2VPVND0PM_j_oldcurrDistmaskblock block_getxch1ch2PM_jTRHPHNs&& n/Users/max/.openclaw/workspace/postharvest/merge_env/lib/python3.14/site-packages/rapidfuzz/distance/OSA_py.py_osa_distance_hyrroe2003r sF 2w s2w,! B B BH2wH R1 D E I AsA&*  aa t|!X - R2% - 2 WG*_ W $Y1$$R$Y1$$Ag] 1W BG*_ W), O processorN score_cutoffcVeV!V4pV!V4p\W4wr\W4pVeWC8:dV#V^,#)a? Calculates the optimal string alignment (OSA) distance. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : int, optional Maximum distance between s1 and s2, that is considered as a result. If the distance is bigger than score_cutoff, score_cutoff + 1 is returned instead. Default is None, which deactivates this behaviour. Returns ------- distance : int distance between s1 and s2 Examples -------- Find the OSA distance between two strings: >>> from rapidfuzz.distance import OSA >>> OSA.distance("CA", "AC") 2 >>> OSA.distance("CA", "ABC") 3 )rr)r r rr dists&&$$ rdistancer#4sNP r] r] B #FB #B +D (D,@4W|VWGWWrcVeV!V4pV!V4p\W4wr\\V4\V44p\W4pWE, pVeWc8dV#^#)a Calculates the optimal string alignment (OSA) similarity in the range [max, 0]. This is calculated as ``max(len1, len2) - distance``. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : int, optional Maximum distance between s1 and s2, that is considered as a result. If the similarity is smaller than score_cutoff, 0 is returned instead. Default is None, which deactivates this behaviour. Returns ------- similarity : int similarity between s1 and s2 )rmaxr r#)r r rr maximumr"sims&&$$ r similarityr(esc@ r] r] B #FB#b'3r7#G B D .C'3+>3FQFrc2\4\V4'g\V4'dR#VeV!V4pV!V4p\W4wr\\ V4\ V44p\ W4pV'd WT, M^pVeWc8:dV#^#)a Calculates a normalized optimal string alignment (OSA) similarity in the range [1, 0]. This is calculated as ``distance / max(len1, len2)``. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : float, optional Optional argument for a score threshold as a float between 0 and 1.0. For norm_dist > score_cutoff 1.0 is returned instead. Default is 1.0, which deactivates this behaviour. Returns ------- norm_dist : float normalized distance between s1 and s2 as a float between 0 and 1.0 ?)rrrr%r r#)r r rr r&r" norm_dists&&$$ rnormalized_distancer,s>Mr{{gbkk r] r] B #FB#b'3r7#G B D")qI%-1J9RQRRrc\4\V4'g\V4'dR#VeV!V4pV!V4p\W4wr\W4pRV, pVeWS8dV#^#)a Calculates a normalized optimal string alignment (OSA) similarity in the range [0, 1]. This is calculated as ``1 - normalized_distance`` Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : float, optional Optional argument for a score threshold as a float between 0 and 1.0. For norm_sim < score_cutoff 0 is returned instead. Default is 0, which deactivates this behaviour. Returns ------- norm_sim : float normalized similarity between s1 and s2 as a float between 0 and 1.0 gr*)rrrr,)r r rr r+norm_sims&&$$ rnormalized_similarityr/si>Mr{{gbkk r] r] B #FB#B+IYH$,0H8PqPr) __future__rrapidfuzz._common_pyrrapidfuzz._utilsrrrr#r(r,r/rrr4s#/1(V.X .X  .Xb(G (G  (GV+S +S  +S\*Q *Q  *Qr