Current File : //proc/self/root/kunden/usr/share/emacs/27.2/lisp/gnus/gnus-range.elc |
;ELC
;;; Compiled
;;; in Emacs version 27.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.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
#@88 Normalize RANGE.
If RANGE is a single range, return (RANGE). Otherwise, return RANGE.
(defalias 'gnus-range-normalize #[(range) "\243<\203 \207C\207" [range] 1 (#$ . 408)])
(put 'gnus-range-normalize 'byte-optimizer 'byte-compile-inline-expand)
#@30 Return last element of LIST.
(defalias 'gnus-last-element #[(list) "A\203\f A\211\202 @\207" [list] 2 (#$ . 664)])
(byte-code "\300\301\302\303#\210\304\305\306\307#\210\300\305\306\303#\207" [make-obsolete gnus-last-element "use `car' of `last' instead." "27.1" defalias gnus-copy-sequence copy-tree nil] 4)
#@65 Return a list of elements of LIST1 that do not appear in LIST2.
(defalias 'gnus-set-difference #[(list1 list2) "\306\307\310\"\311\n\311\211\203 \f@\312\313 #\210\fA\211\204 *
\311\211\203= \f@\314 \"\2046 B\fA\211\204( *\237*\207" [result hash2 list2 elt --dolist-tail-- list1 make-hash-table :test eq nil puthash t gethash] 5 (#$ . 984)])
#@103 Return a range comprising all the RANGES, which are pre-sorted.
RANGES will be destructively altered.
(defalias 'gnus-range-nconcat #[(&rest ranges) "\305\306\"\211\211A\242\211\243<\203 \202 C)\303\n!\306\211\203\235 \f@\211\211\243<\2034 \2026 C)@\247\203F \211@@B\240\210 @\247\203T \211@ @B\240\210@AT @@U\203n @ @A\241\210 A\241\210\202\222 \241\210 @@ @AU\203\202 \211@@\240\210@@@AU\203\222 \211@@\240\210\303!\fA\211\204% *\n@:\203\260 \nG\307U\203\260 \n@\202\261 \n*\207" [ranges range result last --dolist-tail-- delete nil 1] 4 (#$ . 1350)])
#@110 Return the range of elements in RANGE1 that do not appear in RANGE2.
Both ranges must be in ascending order.
(defalias 'gnus-range-difference #[(range1 range2) "\211\243<\203\f \202 C)\n\211\243<\203 \202 C)\306\307!B\211\310\fA\203\374 \fA@ \n@\n \247\203C \202F @ \247\203S \202V A\f\n\247\203c \n\202f \n@
\n\247\203s \n\202v \nA\fV\203\211 \f\211AA\241\210\202\367 \fU\203\240 <\203\240 \fA\240\210\202\367
\204\252 \306\202\367 \f
W\203\272 \f\211A\210\202\367 W\203\312 \n\211A\210\202\367
X\203\343 \fX\203\343 \f\211AA\241\210\202\367 \f
SBT\fBD\fAA\244\241\210.\202* A+\207" [range1 range range2 new-range r safe nil copy-sequence t r1 r2 min1 max1 min2 max2] 5 (#$ . 1945)])
#@135 Return a list of elements of LIST1 that do not appear in LIST2.
Both lists have to be sorted over <.
The tail of LIST1 is not copied.
(defalias 'gnus-sorted-difference #[(list1 list2) "\303 \2035 \n\2035 @\n@U\203 A\nA\202 @\n@W\203/ @B A\211\202 \nA\202 \237 \244)\207" [out list1 list2 nil] 3 (#$ . 2713)])
#@121 Return a list of elements of LIST1 that do not appear in LIST2.
Both lists have to be sorted over <.
LIST1 is modified.
(defalias 'gnus-sorted-ndifference #[(list1 list2) "\304B\211\203; \203; @@U\203$ \nA\241\210AA\202 @@W\2035 A\211\202 A\202 A*\207" [list1 top prev list2 nil] 3 (#$ . 3045)])
#@105 Return a list of elements that are in LIST1 or LIST2 but not both.
Both lists have to be sorted over <.
(defalias 'gnus-sorted-complement #[(list1 list2) "\303 \203\n \n\204 \206R \n\202R \203J \n\203J @\n@U\203+ A\nA\202 @\n@W\203? @B A\211\202 \n@B\nA\202 \237 \206Q \n\244)\207" [out list1 list2 nil] 3 (#$ . 3372)])
(defalias 'gnus-intersection #[(list1 list2) "\303 \203 @\n>\203 @B A\211\204 )\207" [result list2 list1 nil] 3])
#@83 Return intersection of LIST1 and LIST2.
LIST1 and LIST2 have to be sorted over <.
(defalias 'gnus-sorted-intersection #[(list1 list2) "\303 \2035 \n\2035 @\n@U\203 @B A\nA\202 @\n@W\203/ A\211\202 \nA\202 \237)\207" [out list1 list2 nil] 3 (#$ . 3842)])
#@87 Return intersection of RANGE1 and RANGE2.
RANGE1 and RANGE2 have to be sorted over <.
(defalias 'gnus-sorted-range-intersection #[(range1 range2) "\306 @\211\247\203 A\247\203 A\306\202 \n\202 \nA\n@\f@\211\247\203: \fA\247\2036 \fA\306\202?
\202?
A
@ A\fA\n\203\322
\203\322
W\203] A\306\202\234 \nW\203l \fA\306\202\234 \n
]^\211 U\203\205 B\202\214 BB*W\203\232 \306\202\234 \306\n\204\265 @\211\247\203\254 \n\202\261 \nA\n@ A
\204G \f@\211\247\203\305
\202\312
A
@\fA\202G A\203\334 \237\202\350 @\247\203\346 \202\350 @-\207" [out range1 min1 max1 range2 min2 nil max2 max min] 4 (#$ . 4118)])
(defalias 'gnus-set-sorted-intersection 'gnus-sorted-nintersection)
#@118 Return intersection of LIST1 and LIST2 by modifying cdr pointers of LIST1.
LIST1 and LIST2 have to be sorted over <.
(defalias 'gnus-sorted-nintersection #[(list1 list2) "\304B\211\203; \203; @@U\203! AA\202 @@W\2035 \nA\241\210A\211\202 A\202 \n\304\241\210 A*\207" [list1 top prev list2 nil] 3 (#$ . 4862)])
#@76 Return union of LIST1 and LIST2.
LIST1 and LIST2 have to be sorted over <.
(defalias 'gnus-sorted-union #[(list1 list2) "\303 \203? \n\203? @\n@U\203 @B A\nA\202 @\n@W\2034 @B A\211\202 \n@B\nA\202 \203O @B A\211\204C \n\203_ \n@B\nA\211\204S \237)\207" [out list1 list2 nil] 3 (#$ . 5201)])
#@111 Return union of LIST1 and LIST2 by modifying cdr pointers of LIST1.
LIST1 and LIST2 have to be sorted over <.
(defalias 'gnus-sorted-nunion #[(list1 list2) "\304B\211\203E \203E @@U\203! AA\202 @@W\2032 A\211\202 \n@C\241\210\nAA\n\241\210\202 \203Y \n@C\241\210\nAA\211\204I A*\207" [list1 top prev list2 nil] 3 (#$ . 5528)])
#@150 Convert sorted list of numbers to a list of ranges or a single range.
If ALWAYS-LIST is non-nil, this function will always release a list of
ranges.
(defalias 'gnus-compress-sequence #[(numbers &optional always-list) "@@\305\205u A<\204 \202u \203L \n@U\204E \nT@U\203/ @\202E \nU\2039 \202<