ACIL FM
Dark
Refresh
Current DIR:
/opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/pygments
/
opt
alt
python313
lib
python3.13
site-packages
pip
_vendor
pygments
Upload
Zip Selected
Delete Selected
Pilih semua
Nama
Ukuran
Permission
Aksi
filters
-
chmod
Open
Rename
Delete
formatters
-
chmod
Open
Rename
Delete
lexers
-
chmod
Open
Rename
Delete
styles
-
chmod
Open
Rename
Delete
__pycache__
-
chmod
Open
Rename
Delete
cmdline.py
23.13 MB
chmod
View
DL
Edit
Rename
Delete
console.py
1.66 MB
chmod
View
DL
Edit
Rename
Delete
filter.py
1.89 MB
chmod
View
DL
Edit
Rename
Delete
formatter.py
4.08 MB
chmod
View
DL
Edit
Rename
Delete
lexer.py
33.81 MB
chmod
View
DL
Edit
Rename
Delete
modeline.py
986 B
chmod
View
DL
Edit
Rename
Delete
plugin.py
2.53 MB
chmod
View
DL
Edit
Rename
Delete
regexopt.py
3 MB
chmod
View
DL
Edit
Rename
Delete
scanner.py
3.02 MB
chmod
View
DL
Edit
Rename
Delete
sphinxext.py
6.72 MB
chmod
View
DL
Edit
Rename
Delete
style.py
6.11 MB
chmod
View
DL
Edit
Rename
Delete
token.py
6.04 MB
chmod
View
DL
Edit
Rename
Delete
unistring.py
61.74 MB
chmod
View
DL
Edit
Rename
Delete
util.py
9.99 MB
chmod
View
DL
Edit
Rename
Delete
__init__.py
2.91 MB
chmod
View
DL
Edit
Rename
Delete
__main__.py
353 B
chmod
View
DL
Edit
Rename
Delete
Edit file: /opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/pygments/regexopt.py
""" 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. """ import re from re import escape from os.path import commonprefix from itertools import groupby from operator import itemgetter CS_ESCAPE = re.compile(r'[\[\^\\\-\]]') FIRST_ELEMENT = itemgetter(0) def make_charset(letters): return '[' + CS_ESCAPE.sub(lambda m: '\\' + m.group(), ''.join(letters)) + ']' def regex_opt_inner(strings, open_paren): """Return a regex that matches any string in the sorted list of strings.""" close_paren = open_paren and ')' or '' # print strings, repr(open_paren) if not strings: # print '-> nothing left' return '' first = strings[0] if len(strings) == 1: # print '-> only 1 string' return open_paren + escape(first) + close_paren if not first: # print '-> first string empty' return open_paren + regex_opt_inner(strings[1:], '(?:') \ + '?' + close_paren if len(first) == 1: # multiple one-char strings? make a charset oneletter = [] rest = [] for s in strings: if len(s) == 1: oneletter.append(s) else: rest.append(s) if len(oneletter) > 1: # do we have more than one oneletter string? if rest: # print '-> 1-character + rest' return open_paren + regex_opt_inner(rest, '') + '|' \ + make_charset(oneletter) + close_paren # print '-> only 1-character' return open_paren + make_charset(oneletter) + close_paren prefix = commonprefix(strings) if prefix: plen = len(prefix) # we have a prefix for all strings # print '-> prefix:', prefix return open_paren + escape(prefix) \ + regex_opt_inner([s[plen:] for s in strings], '(?:') \ + close_paren # is there a suffix? strings_rev = [s[::-1] for s in strings] suffix = commonprefix(strings_rev) if suffix: slen = len(suffix) # print '-> suffix:', suffix[::-1] return open_paren \ + regex_opt_inner(sorted(s[:-slen] for s in strings), '(?:') \ + escape(suffix[::-1]) + close_paren # recurse on common 1-string prefixes # print '-> last resort' return open_paren + \ '|'.join(regex_opt_inner(list(group[1]), '') for group in groupby(strings, lambda s: s[0] == first[0])) \ + close_paren def regex_opt(strings, prefix='', suffix=''): """Return 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. """ strings = sorted(strings) return prefix + regex_opt_inner(strings, '(') + suffix
Simpan
Batal
Isi Zip:
Unzip
Create
Buat Folder
Buat File
Terminal / Execute
Run
Chmod Bulk
All File
All Folder
All File dan Folder
Apply