Li SrSSKrSSKJr SSKJr SSKJr \R"S5r\"S5r Sr Sr S r S S jr g) 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 [\[\^\\\-\]]cU(dg[U5n[U5n[U5Hup4XBU:wdMUSUs $ U$)zJGiven an iterable of strings, returns the longest common leading substringN)minmax enumerate)ms1s2ics c/var/www/html/backend/Backoffice_Marketplace/venv/lib/python3.13/site-packages/pygments/regexopt.py commonprefixrsE  QB QB"  1:bq6M IcZS[RSSRU55-S-$)N[c(SUR5-$)N\)group)r s rmake_charset.."s )9rr]) CS_ESCAPEsubjoin)letterss r make_charsetr!s' 92777;KL Ls RRrc ^ ^ U=(a S=(d SnU(dgUSm [U5S:XaU[T 5-U-$T (dU[USSS5-S-U-$[T 5S:Xa/n/nUH6n[U5S:XaURU5 M%URU5 M8 [U5S:a9U(a!U[US5-S-[ U5-U-$U[ U5-U-$[ U5nU(a<[U5nU[U5-[UVs/sHoUUSPM snS5-U-$UVs/sH oUSSS 2PM nn[ U5n U (aB[U 5m U[[ U 4S jU55S5-[U SSS 25-U-$USRS [UU 4S j555-U-$s snfs snf) zEReturn a regex that matches any string in the sorted list of strings.)rrNz(?:?|c3.># UH oST*v M g7f)N).0sslens r "regex_opt_inner..Ss$@1vYsc3R# UHn[[US5S5v M g7f)r"rN)regex_opt_innerlist)r(rs rr+r,Xs*LJU!eAh44Js%'c>USTS:H$)Nrr')r)firsts rr!regex_opt_inner..Ys1q9Ir) lenrr.appendrrsortedrr) strings open_paren close_paren oneletterrestr)prefixplen strings_revsuffixr1r*s @@rr.r.%s$*K  AJE 7|qF5M)K77 OGABK??   5zQ A1v{  # A  y>A !OD"$==C"9-.0;<< Y 77+E E ' "F 6{F6N*9Ax95AB %,,GqTrT7GK, + &F 6{f$@$@@%HIVDbD\"#%01 1  L%g/IJL L L  :-s -G G$c<[U5nU[US5-U-$)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