+ Hj;zRt^RIHt^RIt^RIt^RIHt^RIHt^RI H t H t H t RR.t ^RIHt^R IHtHtHtHtHtHtHtHtHtHtHtHtHtHt] 'd^R IH t ]PBR*8;'d ]"!]R 4t#^ t$!R R ]4t%]!RR7RRl4t&]!RR7RRl4t']!RR7RRl4t(]!RR7RRl4t)]!RR7RRl4t*!RR] 4t+]!RR7RRl4t,RRlt-R+R R!llt.R+R"R#llt/R$R%lt0R&R'lt1R+R(R)llt2]#'d].t3R#]/t3R#),z Grapheme cluster segmentation following Unicode Standard Annex #29. This module provides pure-Python implementation of the grapheme cluster boundary algorithm as defined in UAX #29: Unicode Text Segmentation. https://www.unicode.org/reports/tr29/ ) annotationsN)IntEnum) lru_cache) TYPE_CHECKINGOptional NamedTuplezwcwidth.bisearchzwcwidth.table_grapheme)bisearch) GRAPHEME_L GRAPHEME_T GRAPHEME_V GRAPHEME_LV INCB_EXTEND INCB_LINKER GRAPHEME_LVTINCB_CONSONANTGRAPHEME_EXTENDGRAPHEME_CONTROLGRAPHEME_PREPENDGRAPHEME_SPACINGMARKEXTENDED_PICTOGRAPHICGRAPHEME_REGIONAL_INDICATOR)Iteratoriter_graphemescR]tRt^8tRt^t^t^t^t^t ^t ^t ^t ^t ^ t^ t^ t^ t^ tRtR#)GCBz'Grapheme Cluster Break property values.N)__name__ __module__ __qualname____firstlineno____doc__OTHERCRLFCONTROLEXTENDZWJREGIONAL_INDICATORPREPEND SPACING_MARKLVTLVLVT__static_attributes__rڒ/home/ubuntu/.hermes/installs/5f0a1ff4045d044e/environments/88679baa1dc64374a0cd943b62eeefb9/venv/lib/python3.14/site-packages/wcwidth/grapheme.pyrr8sL1 E B BG F CGL A A A B Cr0ri)maxsizec V^8dQhRRRR/#)ucsintreturnrr)formats"r1 __annotate__r9Osr0cV^ 8Xd\P#V^ 8Xd\P#VR8Xd\P#\ V\ 4'd\P #\ V\4'd\P#\ V\4'd\P#\ V\4'd\P#\ V\4'd\P#\ V\4'd\P #\ V\"4'd\P$#\ V\&4'd\P(#\ V\*4'd\P,#\ V\.4'd\P0#\P2#)z;Return the Grapheme_Cluster_Break property for a codepoint.i )rr"r#r& _bisearchrr$rr%rr'rr(rr)r r*r r+r r,r r-rr.r!r5s&r1_grapheme_cluster_breakr=Ns'  f}vv  f}vv  f}ww&''{{o&&zz122%%%&''{{*++j!!uu j!!uu j!!uu k""vv l##ww 99r0c V^8dQhRRRR/#r4r5r6r7boolr)r8s"r1r9r9rs773747r0c4\\V\44#)z6Check if codepoint has Extended_Pictographic property.)r@r;rr<s&r1_is_extended_pictographicrBqs  #45 66r0c V^8dQhRRRR/#r?r)r8s"r1r9r9x----r0c4\\V\44#)z,Check if codepoint has InCB=Linker property.)r@r;rr<s&r1_is_incb_linkerrFw  #{+ ,,r0c V^8dQhRRRR/#r?r)r8s"r1r9r9~s00C0D0r0c4\\V\44#)z/Check if codepoint has InCB=Consonant property.)r@r;rr<s&r1_is_incb_consonantrJ}s  #~. //r0c V^8dQhRRRR/#r?r)r8s"r1r9r9rDr0c4\\V\44#)z,Check if codepoint has InCB=Extend property.)r@r;r r<s&r1_is_incb_extendrMrGr0c0]tRt^t$RtR]R&R]R&RtR#) BreakResultz*Result of grapheme cluster break decision.r@ should_breakr6ri_countrN)rrrrr __annotations__r/rr0r1rOrOs4Mr0rOc$V^8dQhRRRRRR/#)r4prev_gcbrcurr_gcbr7zOptional[BreakResult]r)r8s"r1r9r9s"--#--9N-r0cJV\P8Xd#V\P8Xd\R^R7#V\P\P\P39d\R^R7#V\P\P\P39d\R^R7#V\P 8XdQV\P \P \P\P39d\R^R7#V\P\P 39d3V\P \P39d\R^R7#V\P\P39d#V\P8Xd\R^R7#V\P8Xd\R^R7#V\P8Xd\R^R7#V\P8Xd\R^R7#R#)z Check simple GCB-pair-based break rules (cacheable). Returns BreakResult for rules that can be determined from GCB properties alone, or None if complex lookback rules (GB9c, GB11) need to be checked. FrPrQTN) rr"r#rOr$r*r+r-r.r,r%r)r()rTrUs&&r1_simple_break_checkrXst366h#&&0::CKK00q99CKK00q99355X#%%)HH::CFFCEE?"xCEE355>'A::CGGSUU##CEE(9::3::::3###::3;;:: r0c 0V^8dQhRRRRRRRRRRR R /#) r4rTrrUtextstrcurr_idxr6rQr7rOr)r8s"r1r9r9sL@=@=@=@= @= @=  @=  @=r0c\W4pVeV#V\P8Xd\R^R7#\ W#,4p\ V4'dRpV^, pV^8dt\ W(,4p \ V 4'dRpV^,pK6\V 4'd V^,pKR\ V 4'dV'd\R^R7#MV\P8Xd}\V4'dlV^, pV^8d\\ W(,4p \V 4p V \P8Xd V^,pKC\V 4'd\R^R7#V\P8XdEV\P8Xd0V^,^8Xd\RV^,R7#\R^R7#V\P8Xd^M^p\RVR7#)z Determine if there should be a grapheme cluster break between prev and curr. Implements UAX #29 grapheme cluster boundary rules. FrWT) rXrr&rOordrJrFrMrBr=r%r') rTrUrZr\rQresultcurr_ucs has_linkeriprev_ucs prev_props &&&&& r1 _should_breakres! 4F  377:: 4>"H(## qL1f47|Hx((! Q **Q#H--&EAFF3778BB qL1f47|H/9ICJJ&Q*844"BB3)))h#:P:P.P a<1 EHqLI Iq99 6 66qAH D8 <>> list(iter_graphemes('cafe\u0301')) ['c', 'a', 'f', 'e\u0301'] >>> list(iter_graphemes('ok\U0001F468\u200D\U0001F469\u200D\U0001F467')) ['o', 'k', '\U0001F468\u200D\U0001F469\u200D\U0001F467'] >>> list(iter_graphemes('ok\U0001F1FA\U0001F1F8')) ['o', 'k', '\U0001F1FA\U0001F1F8'] .. versionadded:: 0.3.0 N)lenmin unicodedatarrirj)rhrirjlength full_segmentsegs&&& r1_iter_graphemes_stdlibrtsh8  [F { |u c C$L)),799SWW--8sA2A4c(V^8dQhRRRRRRRR/#) r4rhr[rir6rjz int | Noner7rkr)r8s"r1r9r92s6A$A$ A$ A$ A$ A$r0c#"V'gR#\V4pVfTpW8gW8dR#\W#4pTp^p\\W,44pV\P 8Xd^p\ V^,V4FRp\\W,44p\WhWV4p V PpV P'd WVxTpTpKT WVxR#5irm) rnror=r^rr'rangererQrP) rhrirjrq cluster_startrQrTidxrUr_s &&& r1_iter_graphemes_pythonrz2s8  [F { |u c CMH's6='9:H3)))UQY$*3v{+;<x6I??    s+ +M% s ##sCCc$V^8dQhRRRRRR/#)r4rZr[posr6r7r)r8s"r1r9r9vs!11c111r0ct\W^, ,4pV^ 8Xd%V^8dW^, ,R8Xd V^, #V^8dgV^8dWV^ 8dP\W^, ,4pV^8d1\V4\P8Xd\ W^, 4#V^, #V^, pV^8d`W, \ 8dO\W,4p^ Tu;8:d^8dMMM*\V4\P 8XdM V^,pKfTp\\W,44pV\P8Xd^M^p\V^,V4FLp \\W ,44p \WzW V4p V PpV P'dT pT pKN V#)ac Find the start of the grapheme cluster containing the character before pos. Scans backwards from pos to find a safe starting point, then iterates forward using standard break rules to find the actual cluster boundary. :param text: The Unicode string. :param pos: Position to search before (exclusive). :returns: Start position of the grapheme cluster.  ) r^r=rr(_find_cluster_startMAX_GRAPHEME_SCANr$r'rwrerQrP) rZr| target_cpprev_cp safe_startcprxleft_gcbrQrb right_gcbr_s && r1rrvspDqM"IDSAX$Qw-4*?Qw4 !8 T)$Qw-(G$#:7#Cs{{#R*4q99QwqJ q.c.2CC ! " 2    "2 &#++ 5 a M&s4+;'<=H 6 66qAH :>3 '+CL9 xDXF??    M ( r0c$V^8dQhRRRRRR/#)r4rhr[r|r6r7r)r8s"r1r9r9s!>>S>s>s>r0c RV^8:d^#\V\V\V444#)a Find the grapheme cluster boundary immediately before a position. :param unistr: The Unicode string to search. :param pos: Position in the string (0 < pos <= len(unistr)). :returns: Start index of the grapheme cluster containing the character at pos-1. Example:: >>> grapheme_boundary_before('Hello \U0001F44B\U0001F3FB', 8) 6 >>> grapheme_boundary_before('a\r\nb', 3) 1 .. versionadded:: 0.3.6 )rrorn)rhr|s&&r1grapheme_boundary_beforers&" ax vs3F '< ==r0c(V^8dQhRRRRRRRR/#rgr)r8s"r1r9r9s0&& & & & &r0c#"V'gR#\V4pVfTM \W#4p\V^4pW8gW8dR#TpWA8d\W4pWQ8dR#WVxTpK#R#5i)ay Iterate over grapheme clusters in reverse order (last to first). :param unistr: The Unicode string to segment. :param start: Starting index (default 0). :param end: Ending index (default len(unistr)). :yields: Grapheme cluster substrings in reverse order. Example:: >>> list(iter_graphemes_reverse('cafe\u0301')) ['e\u0301', 'f', 'a', 'c'] .. versionadded:: 0.3.6 N)rnromaxr)rhrirjrqr|rxs&&& r1iter_graphemes_reverserso(  [FK&S%5C qME |u C ++F8  3'' sA(A*))N)4r __future__rsysrpenumr functoolsrtypingrrr__lazy_modules__rr;table_graphemer r r r r rrrrrrrrrcollections.abcr version_infohasattr_HAS_PYTHON315_ITER_GRAPHEMESrrr=rBrFrJrMrOrXrertrzrrrrrr0r1rsp# 66 , : : : :(// -. ' , 4D 477  4--  400  4-- * 4--`@=F+.\A$H1h>,&V< r0