Function: seq-drop-while
seq-drop-while is a byte-compiled function defined in transient.el.
Signature
(seq-drop-while PRED SEQUENCE)
Documentation
Remove the successive elements of SEQUENCE for which PRED returns non-nil.
PRED is a function of one argument. The function keeps removing elements from SEQUENCE until PRED returns nil for an element. Value is a sequence of the same type as SEQUENCE.
Other relevant functions are documented in the sequence group.
Shortdoc
;; sequence
(seq-drop-while #'numberp '(1 2 c d 5))
=> (c d 5)Implementations
(pred (list list)) in `seq-25.el'.
Optimized implementation of `seq-drop-while' for lists.
(pred sequence) in `seq-25.el'.
Undocumented
Source Code
;; Defined in ~/.emacs.d/elpa/transient-20260414.1009/transient.el
;; Could not find source code, showing raw function object.
#[642 "\304\203 �\305!\202\f�\306\303\307\"\2067�\310\300\311\301\302\312\313 \203'�\305\f!\202(�\306!\314\315!\"%\316#\210\211\262\266\202$\207"
[#s(cl--generic seq-drop-while
((1 #s(cl--generic-generalizer cl--generic-typeof-generalizer 10
#[385 "\300\301D\302BBB\207"
[if type-of
('null)]
6 "\n\n(fn NAME &rest _)"]
#[385 "9\205�\236\207"
[cl--typeof-types]
4 "\n\n(fn TAG &rest _)"])
#s(cl--generic-generalizer cl--generic-t-generalizer 0
#[385 "\300\207"
[nil]
3 "\n\n(fn NAME &rest _)"]
#[385 "\300\207"
[(t)]
3 "\n\n(fn TAG &rest _)"]))
(0 #s(cl--generic-generalizer cl--generic-t-generalizer 0
#[385 "\300\207"
[nil]
3 "\n\n(fn NAME &rest _)"]
#[385 "\300\207"
[(t)]
3 "\n\n(fn TAG &rest _)"])))
(#s(cl--generic-method
(t list)
nil nil
#[514 "\211\203�@!\203�\211A\262\202��\207"
[]
4 "Optimized implementation of `seq-drop-while' for lists.\n\n(fn PRED LIST)"])
#s(cl--generic-method
(t t)
nil nil
#[514 "\300\301\"\"\207"
[seq-drop seq--count-successive]
7 "\n\n(fn PRED SEQUENCE)"]))
nil)
((0 #s(cl--generic-generalizer cl--generic-t-generalizer 0
#[385 "\300\207"
[nil]
3 "\n\n(fn NAME &rest _)"]
#[385 "\300\207"
[(t)]
3 "\n\n(fn TAG &rest _)"])))
(#s(cl--generic-method
(t list)
nil nil
#[514 "\211\203�@!\203�\211A\262\202��\207"
[]
4 "Optimized implementation of `seq-drop-while' for lists.\n\n(fn PRED LIST)"])
#s(cl--generic-method
(t t)
nil nil
#[514 "\300\301\"\"\207"
[seq-drop seq--count-successive]
7 "\n\n(fn PRED SEQUENCE)"]))
#s(hash-table size 65 test eql rehash-size 1.5 rehash-threshold 0.8125 data
())
apply type-of null gethash cl--generic-cache-miss 1 append
#[385 "9\205�\236\207"
[cl--typeof-types]
4 "\n\n(fn TAG &rest _)"]
#[385 "\300\207"
[(t)]
3 "\n\n(fn TAG &rest _)"]
nil puthash]
15 "\n\n(fn ARG0 ARG &rest ARGS)"]