2bi S r SSKrSSKJr SSKJr SSKJr SSKJr \R " S5 r
\" S5 r S r S r
S S
jrg) z
pygments.regexopt
~~~~~~~~~~~~~~~~~
An algorithm that generates optimized regexes for matching long lists of
literal strings.
:copyright: Copyright 2006-2023 by the Pygments team, see AUTHORS.
:license: BSD, see LICENSE for details.
N)escape) commonprefix)groupby)
itemgetterz [\[\^\\\-\]]c Z S[ R S SR U 5 5 - S- $ )N[c ( SU R 5 - $ )N\)group)ms ڏ/builddir/build/BUILDROOT/alt-python313-pip-23.3.1-3.el8.x86_64/opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/pygments/regexopt.py make_charset.. s )9 ]) CS_ESCAPEsubjoin)letterss r
make_charsetr s' 92777;KL Ls RRr c ^
^ U=( a S=( d SnU ( d gU S m
[ U 5 S:X a U[ T
5 - U- $ T
( d U[ U SS S5 - S- U- $ [ T
5 S:X a / n/ nU H6 n[ U5 S:X a UR U5 M% UR U5 M8 [ U5 S: a9 U( a! U[ US5 - S- [ U5 - U- $ U[ U5 - U- $ [ U 5 nU( a< [ U5 nU[ U5 - [ U Vs/ s H oUUS PM snS5 - U- $ U Vs/ s H
oUSSS 2 PM nn[ U5 n U ( aB [ U 5 m U[ [
U 4S
jU 5 5 S5 - [ U SSS 2 5 - U- $ USR S [ U U
4S j5 5 5 - U- $ s snf s snf )
zEReturn a regex that matches any string in the sorted list of strings.)r r Nz(?:?|c 3 . ># U H
oS T* v M g 7f)N ).0sslens r
"regex_opt_inner..H s $@1vYs c 3 R # U H n[ [ US 5 S5 v M g7f)r r N)regex_opt_innerlist)r r s r
r# r$ M s* L JU !eAh 44 Js %'c > U S TS :H $ )Nr r )r! firsts r
r !regex_opt_inner..N s 1q9Ir ) lenr r& appendr r sortedr r ) strings
open_paren close_paren oneletterrestr! prefixplen strings_revsuffixr) r" s @@r
r& r& s $*K AJE
7|qF5M)K77 OGABK ??
5zQ A1v{ # A
y>A !OD"$==C"9-.0;< < Y 77+E E
'
"F
6{ F6N* 9Ax 95AB %,,GqTrT7GK,
+
&F
6{ f$@$@ @%HIVDbD\"#%01 1
L %g/I JL L L : -s -G
G$c < [ U 5 n U[ U S5 - 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.
()r- r& )r. r3 r6 s r
regex_optr9 R s$ WoG OGS1 1F ::r )r r )__doc__rer os.pathr itertoolsr operatorr compiler
FIRST_ELEMENTr r& r9 r r r
rA sC
JJ ' 1
S5p ;r