+ ~j Rt^RIt^RIHt^RIHt^RIHt]P!R4t]!^4t Rt Rt Rt R R lt R#) z pygments.regexopt ~~~~~~~~~~~~~~~~~ An algorithm that generates optimized regexes for matching long lists of literal strings. :copyright: Copyright 2006-present by the Pygments team, see AUTHORS. :license: BSD, see LICENSE for details. N)escape)groupby) itemgetterz [\[\^\\\-\]]cV'gR#\V4p\V4p\V4Fwr4WBV,8wgKVRVu# V#)zJGiven an iterable of strings, returns the longest common leading substringN)minmax enumerate)ms1s2ics& f/Users/mitch_tango/dev/rabbit-r1-livekit/agent/.venv/lib/python3.14/site-packages/pygments/regexopt.py commonprefixrsE  QB QB"  1:bq6M IcjR\PRRPV44,R,#)[c0RVP4,#)\)group)r s&rmake_charset.."s )9rr]) CS_ESCAPEsubjoin)letterss&r make_charsetr!s' 92777;KL Ls RRrc a a T;'d R;'gRpV'gR#V^,o \V4^8XdV\S 4,V,#S 'g)V\VR,R4,R,V,#\S 4^8Xd.p.pVF7p\V4^8XdVPV4K&VPV4K9 \V4^8dSV'd2V\VR4,R,\ V4,V,#V\ V4,V,#\ V4pV'dH\V4pV\V4,\VUu.uFqUVRNK upR4,V,#VUu.uFqURRR 1,NK pp\ V4p V 'dS\V 4o V\\ V 3RlV44R4,\V RRR 1,4,V,#VRPR \VV 3R l444,V,#uupiuupi) zEReturn a regex that matches any string in the sorted list of strings.)r:NNz(?:?|Nc3.<"TF qRS)xK R#5i)N).0sslens& r "regex_opt_inner..Ss$@1vYsc3Z"TF!p\\V^,4R4xK# R#5i)r!rN)regex_opt_innerlist)r&rs& rr)r*Xs*LJU!eAh44Js)+c*<V^,S^,8H#)r%)r'firsts&rr!regex_opt_inner..Ys1q9Ir) lenrr,appendrrsortedrr) strings open_paren close_paren oneletterrestr'prefixplen strings_revsuffixr0r(s && @@rr,r,%s$$**K  AJE 7|qF5M)K77 OGBK??   5zQ A1v{  # A  y>A !OD"$==C"9-.0;<< Y 77+E E ' "F 6{F6N*9Ax95AB %,,GqTrT77GK, + &F 6{f$@$@@%HIVDbD\"#%01 1  L%g/IJL L L  :-s 0 I I cL\V4pV\VR4,V,#)zReturn a compiled regex that matches any string in the given list. The strings to match must be literal strings, not regexes. They will be regex-escaped. *prefix* and *suffix* are pre- and appended to the final regex. ()r5r,)r6r;r>s&&&r regex_optrA]s$WoG OGS1 1F ::r)rr)__doc__rer itertoolsroperatorrcompiler FIRST_ELEMENTrrr,rAr%rrrHsE   JJ ' 1  S5p ;r