a j @shdZddlZddlmZddlmZddlmZedZedZ ddZ d d Z d d Z dddZ dS)a 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 [\[\^\\\-\]]cCsJ|sdSt|}t|}t|D]$\}}|||kr |d|Sq |S)zJGiven an iterable of strings, returns the longest common leading substringN)minmax enumerate)ms1s2icr7E:\soccer\ml_env\Lib\site-packages\pygments/regexopt.py commonprefixs rcCsdtddd|dS)N[cSs d|S)N\)group)r rrr"zmake_charset..r]) CS_ESCAPEsubjoin)lettersrrr make_charset!src s|rdp d}|sdS|dt|dkr8|t|SsZ|t|dddd|Stdkrg}g}|D]&}t|dkr||qr||qrt|dkr|r|t|ddt||S|t||St|}|rt||t|tfd d |Dd|Sd d |D}t|}|rpt||ttfd d |Ddt|ddd|S|ddd t|fddD|S)zEReturn a regex that matches any string in the sorted list of strings.)rrNz(?:?|csg|]}|dqSNr.0s)plenrr Jrz#regex_opt_inner..cSsg|]}|dddqS)Nrr!rrrr%Mrc3s|]}|d VqdSr rr!)slenrr Srz"regex_opt_inner..r&css |]}tt|ddVqdS)rrN)regex_opt_innerlist)r"rrrrr(Xscs|ddkS)Nrr)r#)firstrrrYrz!regex_opt_inner..) lenrr)appendrrsortedrr) strings open_paren close_paren oneletterrestr#prefix strings_revsuffixr)r+r$r'rr)%sj         r)rcCstt|}|t|d|S)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. ()r.setr))r/r4r6rrr regex_opt]s r9)rr)__doc__rer itertoolsroperatorrcompiler FIRST_ELEMENTrrr)r9rrrrs      8