ikan Uploader :
Directory : /usr/share/emacs/25.2/lisp/emacs-lisp/
Upload File : |
| Current File : //usr/share/emacs/25.2/lisp/emacs-lisp/regexp-opt.elc |
;ELC
;;; Compiled
;;; in Emacs version 25.2
;;; with all optimizations.
;;; This file uses dynamic docstrings, first added in Emacs 19.29.
;;; This file does not contain utf-8 non-ASCII characters,
;;; and so can be loaded in Emacs versions earlier than 23.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
#@1397 Return a regexp to match a string in the list STRINGS.
Each string should be unique in STRINGS and should not contain
any regexps, quoted or not. Optional PAREN specifies how the
returned regexp is surrounded by grouping constructs.
The optional argument PAREN can be any of the following:
a string
the resulting regexp is preceded by PAREN and followed by
\), e.g. use "\\(?1:" to produce an explicitly numbered
group.
`words'
the resulting regexp is surrounded by \=\<\( and \)\>.
`symbols'
the resulting regexp is surrounded by \_<\( and \)\_>.
non-nil
the resulting regexp is surrounded by \( and \).
nil
the resulting regexp is surrounded by \(?: and \), if it is
necessary to ensure that a postfix operator appended to it will
apply to the whole expression.
The resulting regexp is equivalent to but usually more efficient
than that of a simplified version:
(defun simplified-regexp-opt (strings &optional paren)
(let ((parens
(cond ((stringp paren) (cons paren "\\)"))
((eq paren 'words) '("\\\=<\\(" . "\\)\\>"))
((eq paren 'symbols) '("\\_<\\(" . "\\)\\_>"))
((null paren) '("\\(?:" . "\\)"))
(t '("\\(" . "\\)")))))
(concat (car paren)
(mapconcat 'regexp-quote strings "\\|")
(cdr paren))))
(defalias 'regexp-opt #[(strings &optional paren) "\306 \307\216\310\211\311\211
;\203
\202
\205 \312 \313\314\315!\316\"! \317\2061 \320?#
\321=\203E \322\323Q\202U
\324=\203S \325\326Q\202U . \207" [save-match-data-internal max-lisp-eval-depth max-specpdl-size completion-ignore-case completion-regexp-list paren match-data #[nil "\301\302\"\207" [save-match-data-internal set-match-data evaporate] 3] 10000 nil "\\(" delete-dups sort copy-sequence string-lessp regexp-opt-group t words "\\<" "\\>" symbols "\\_<" "\\_>" open strings sorted-strings re] 5 (#$ . 410)])
#@128 Return the depth of REGEXP.
This means the number of non-shy regexp grouping constructs
(parenthesized expressions) in REGEXP.
(defalias 'regexp-opt-depth #[(regexp) "\305 \306\216\307 \310\"\210\311\312\211 \307\313 #\2031 \311\225\314\224\204 \315 \311\224\n#\203 \fT\202 \f-\207" [save-match-data-internal regexp last start count match-data #[nil "\301\302\"\207" [save-match-data-internal set-match-data evaporate] 3] string-match "" 0 nil "\\\\(\\(\\?[0-9]*:\\)?" 1 subregexp-context-p] 4 (#$ . 2413)])
#@265 Return a regexp to match a string in the sorted list STRINGS.
If PAREN non-nil, output regexp parentheses around returned regexp.
If LAX non-nil, don't output parentheses if it doesn't require them.
Merges keywords to avoid backtracking in Emacs's regexp matcher.
(defalias 'regexp-opt-group #[(strings &optional paren lax) ";\203 \202 \203 \306\202 \307\203 \310\202 \307 \203% \307\202& \203/ \307\2020 \n G\311U\203= \307\202\214 G\312U\203d @G\312U\203Y \f\313 @!
Q\202\214 \313 @!\nQ\202\214 @G\311U\203{ \f\314 A\315\211#\316
R\202\214 @G\312U\203 A \203\241 @G\312U\204\241 \211A \210\202\211 )\203\317\211 \317 \211 !\203\340 !@\211 G\312U\203\320 \320 ! B \202\327 B !A\211!\204\270 * \203\367 \314 \237!\321\322 !\n\260\202\376 \f\322 !
Q*\202\214\323\307 \"\211 \"G\311V\203-\"G #\324\325 \" $ \313\"!\314$\315\211#\nR*\202\213\324\326 \" %\323\307%\"\211 &G\311V\203d&G[ #\327\324\330 \"\331\" ' \314'\315\211#\313&\237!\nR*\202\212\332 @\311\312# (\333( \"\211 )G \233 * \314)!\321\314*!\n\260+*),\207" [paren open-group close-group lax open-charset close-charset "\\(?:" "" "\\)" 0 1 regexp-quote regexp-opt-group t "?" nil string-to-char "\\|" regexp-opt-charset try-completion mapcar #[(s) " \302O\207" [s n nil] 3] reverse sort #[(s) "\302 O\207" [s n 0] 3] string-lessp substring-no-properties all-completions strings strs rest letters s --dolist-tail-- prefix n suffixes sgnirts xiffus prefixes char half1 half2] 7 (#$ . 2940)])
#@86 Return a regexp to match a character in CHARS.
CHARS should be a list of characters.
(defalias 'regexp-opt-charset #[(chars) "\306\307!\310\311\312\211 \312\211 \313 \211 \203T @\211 \314=\203, \315\202K \316=\2039 \317\202K \320=\203E \321\202K \322I\210 A\211 \204 *\323\324\"\210\n Y\203\204 \n \325\\V\203r \326\327 \n$\202\204 \n Y\203\204 \326\330 # T\202r \312\230\203\243 \f\312\230\203\243
\312\230\203\232 \331\202\254 \332
\315R\202\254 \332\f
\315\260.\207" [charmap start end charset bracket dash make-char-table case-table -1 -2 "" nil 93 "]" 94 "^" 45 "-" t map-char-table #[(c v) "\205v :\203B @S\nU\203 A\211\207\n \305\\V\203( \306\307\f \n$\202: \n Y\203: \306\310\f # T\202( @ A\211\207 S\nU\203M \211\207\n \305\\V\203_ \306\307\f \n$\202q \n Y\203q \306\310\f # T\202_ \211\207" [v c end start charset 2 format "%s%c-%c" "%s%c"] 5] 2 format "%s%c-%c" "%s%c" "\\^" "[" caret chars char --dolist-tail--] 7 (#$ . 4487)])
(provide 'regexp-opt)
Kontol Shell Bypass