+ =iF4Rt^RIHt^RIHt^RIHt^RIHtH t ^RI H t ^RI H t HtHtHtHtHtHtHtHtHtHtHtHtHt]'d^RIHt^ t!RR ]4t]!R R 7R R l4t]!R R 7RRl4t ]!R R 7RRl4t!]!R R 7RRl4t"]!R R 7RRl4t#!RR] 4t$]!R R 7RRl4t%RRlt&R%RRllt'RR lt(R!R"lt)R%R#R$llt*R#)&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/ ) annotations)IntEnum) lru_cache) TYPE_CHECKING NamedTuple)bisearch) GRAPHEME_L GRAPHEME_T GRAPHEME_V GRAPHEME_LV INCB_EXTEND INCB_LINKER GRAPHEME_LVTINCB_CONSONANTGRAPHEME_EXTENDGRAPHEME_CONTROLGRAPHEME_PREPENDGRAPHEME_SPACINGMARKEXTENDED_PICTOGRAPHICGRAPHEME_REGIONAL_INDICATOR)IteratorcR]tRt^,tRt^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__rs/Users/tonyclaw/.openclaw/workspace/scripts/youtube-playlists/venv/lib/python3.14/site-packages/wcwidth/grapheme.pyrr,sL1 E B BG F CGL A A A B Cr.ri)maxsizec V^8dQhRRRR/#)ucsintreturnrr)formats"r/ __annotate__r7Csr.cV^ 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'rr(r r)r r*r r+rr,rr3s&r/_grapheme_cluster_breakr;Bs'  f}vv  f}vv  f}ww&''{{o&&zz122%%%&''{{*++j!!uu j!!uu j!!uu k""vv l##ww 99r.c V^8dQhRRRR/#r2r3r4r5boolr)r6s"r/r7r7fs773747r.c4\\V\44#)z6Check if codepoint has Extended_Pictographic property.)r>r9rr:s&r/_is_extended_pictographicr@es  #45 66r.c V^8dQhRRRR/#r=r)r6s"r/r7r7l----r.c4\\V\44#)z,Check if codepoint has InCB=Linker property.)r>r9r r:s&r/_is_incb_linkerrDk  #{+ ,,r.c V^8dQhRRRR/#r=r)r6s"r/r7r7rs00C0D0r.c4\\V\44#)z/Check if codepoint has InCB=Consonant property.)r>r9rr:s&r/_is_incb_consonantrHqs  #~. //r.c V^8dQhRRRR/#r=r)r6s"r/r7r7xrBr.c4\\V\44#)z,Check if codepoint has InCB=Extend property.)r>r9r r:s&r/_is_incb_extendrKwrEr.c0]tRt^}t$RtR]R&R]R&RtR#) BreakResultz*Result of grapheme cluster break decision.r> should_breakr4ri_countrN)rrrrr__annotations__r-rr.r/rMrM}s4Mr.rMc$V^8dQhRRRRRR/#)r2prev_gcbrcurr_gcbr5zBreakResult | Noner)r6s"r/r7r7s"--#--9K-r.cJV\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. FrNrOTN) rr r!rMr"r(r)r+r,r*r#r'r&)rRrSs&&r/_simple_break_checkrVst366h#&&0::CKK00q99CKK00q99355X#%%)HH::CFFCEE?"xCEE355>'A::CGGSUU##CEE(9::3::::3###::3;;:: r.c 0V^8dQhRRRRRRRRRRR R /#) r2rRrrStextstrcurr_idxr4rOr5rMr)r6s"r/r7r7sL@=@=@=@= @= @=  @=  @=r.c\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. FrUT) rVrr$rMordrHrDrKr@r;r#r%) rRrSrXrZrOresultcurr_ucs has_linkeriprev_ucs prev_props &&&&& r/ _should_breakrcs! 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('\U0001F468\u200D\U0001F469\u200D\U0001F467')) ['o', 'k', '\U0001F468\u200D\U0001F469\u200D\U0001F467'] >>> list(iter_graphemes('\U0001F1FA\U0001F1F8')) ['o', 'k', '\U0001F1FA\U0001F1F8'] .. versionadded:: 0.3.0 N) lenminr;r\rr%rangercrOrN) rfrgrhlength cluster_startrOrRidxrSr]s &&& r/iter_graphemesrps8  [F { |u c CMH's6='9:H3)))UQY$*3v{+;<x6I??    s+ +M% s ##sCCc$V^8dQhRRRRRR/#)r2rXrYposr4r5r)r6s"r/r7r7<s!11c111r.ct\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%rlrcrOrN) rXrr target_cpprev_cp safe_startcprnleft_gcbrOr` right_gcbr]s && r/ruru<spDqM"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 ( r.c$V^8dQhRRRRRR/#)r2rfrYrrr4r5r)r6s"r/r7r7ps!>>S>s>s>r.c 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 )rurkrj)rfrrs&&r/grapheme_boundary_beforerps&" ax vs3F '< ==r.c(V^8dQhRRRRRRRR/#rer)r6s"r/r7r7s0&& & & & &r.c#"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)rjrkmaxru)rfrgrhrmrrrns&&& r/iter_graphemes_reverserso(  [FK&S%5C qME |u C ++F8  3'' sA(A*)N)+r __future__renumr functoolsrtypingrrrr9table_graphemerr r r r r rrrrrrrrcollections.abcrrvrr;r@rDrHrKrMrVrcrprurrrr.r/rs#,, : : : :( ' , 4D 477  4--  400  4-- * 4--`@=FA$H1h>,&&r.