o \i @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)ms1s2icrO/home/ubuntu/SoloSpeech/.venv/lib/python3.10/site-packages/pygments/regexopt.py commonprefixs rcCsdtddd|dS)N[cSs d|S)N\)group)r rrr"s zmake_charset..r]) CS_ESCAPEsubjoin)lettersrrr make_charset!src s|rdpd}|s dS|dt|dkr|t|Ss-|t|dddd|Stdkrlg}g}|D]}t|dkrG||q9||q9t|dkrl|rd|t|ddt||S|t||St|}|rt||t|tfd d |Dd|Sd d |D}t|}|rt||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 Jsz#regex_opt_inner..cSsg|] }|dddqS)Nrr rrrr$Msc3s|] }|d VqdSrrr )slenrr Ssz"regex_opt_inner..r%css"|] }tt|ddVqdS)rrN)regex_opt_innerlist)r!rrrrr'Xscs|ddkS)Nrr)r")firstrrrYsz!regex_opt_inner..) lenrr(appendrrsortedrr) strings open_paren close_paren oneletterrestr"prefix strings_revsuffixr)r*r#r&rr(%sj         r(rcCst|}|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-r()r.r3r5rrr regex_opt]sr7)rr)__doc__rer itertoolsroperatorrcompiler FIRST_ELEMENTrrr(r7rrrrs     8