seq-autoloads.el (5214B)
1 ;;; seq-autoloads.el --- automatically extracted autoloads (do not edit) -*- lexical-binding: t -*- 2 ;; Generated by the `loaddefs-generate' function. 3 4 ;; This file is part of GNU Emacs. 5 6 ;;; Code: 7 8 (add-to-list 'load-path (or (and load-file-name (directory-file-name (file-name-directory load-file-name))) (car load-path))) 9 10 11 12 ;;; Generated autoloads from seq-24.el 13 14 (register-definition-prefixes "seq-24" '("seq")) 15 16 17 ;;; Generated autoloads from seq-25.el 18 19 (autoload 'seq-subseq "seq-25" "\ 20 Return the sequence of elements of SEQUENCE from START to END. 21 END is exclusive. 22 23 If END is omitted, it defaults to the length of the sequence. If 24 START or END is negative, it counts from the end. Signal an 25 error if START or END are outside of the sequence (i.e too large 26 if positive or too small if negative). 27 28 (fn SEQUENCE START &optional END)") 29 (autoload 'seq-take "seq-25" "\ 30 Return the sequence made of the first N elements of SEQUENCE. 31 The result is a sequence of the same type as SEQUENCE. 32 33 If N is a negative integer or zero, an empty sequence is 34 returned. 35 36 (fn SEQUENCE N)") 37 (autoload 'seq-sort-by "seq-25" "\ 38 Sort SEQUENCE transformed by FUNCTION using PRED as the comparison function. 39 Elements of SEQUENCE are transformed by FUNCTION before being 40 sorted. FUNCTION must be a function of one argument. 41 42 (fn FUNCTION PRED SEQUENCE)") 43 (autoload 'seq-filter "seq-25" "\ 44 Return a list of all the elements in SEQUENCE for which PRED returns non-nil. 45 46 (fn PRED SEQUENCE)") 47 (autoload 'seq-remove "seq-25" "\ 48 Return a list of all the elements in SEQUENCE for which PRED returns nil. 49 50 (fn PRED SEQUENCE)") 51 (autoload 'seq-remove-at-position "seq-25" "\ 52 Return a copy of SEQUENCE with the element at index N removed. 53 54 N is the (zero-based) index of the element that should not be in 55 the result. 56 57 The result is a sequence of the same type as SEQUENCE. 58 59 (fn SEQUENCE N)") 60 (autoload 'seq-reduce "seq-25" "\ 61 Reduce the function FUNCTION across SEQUENCE, starting with INITIAL-VALUE. 62 63 Return the result of calling FUNCTION with INITIAL-VALUE and the 64 first element of SEQUENCE, then calling FUNCTION with that result 65 and the second element of SEQUENCE, then with that result and the 66 third element of SEQUENCE, etc. FUNCTION will be called with 67 INITIAL-VALUE (and then the accumulated value) as the first 68 argument, and the elements from SEQUENCE as the second argument. 69 70 If SEQUENCE is empty, return INITIAL-VALUE and FUNCTION is not called. 71 72 (fn FUNCTION SEQUENCE INITIAL-VALUE)") 73 (autoload 'seq-every-p "seq-25" "\ 74 Return non-nil if PRED returns non-nil for all the elements of SEQUENCE. 75 76 (fn PRED SEQUENCE)") 77 (autoload 'seq-some "seq-25" "\ 78 Return non-nil if PRED returns non-nil for at least one element of SEQUENCE. 79 If the value is non-nil, it is the first non-nil value returned by PRED. 80 81 (fn PRED SEQUENCE)") 82 (autoload 'seq-find "seq-25" "\ 83 Return the first element in SEQUENCE for which PRED returns non-nil. 84 If no such element is found, return DEFAULT. 85 86 Note that `seq-find' has an ambiguity if the found element is 87 identical to DEFAULT, as in that case it is impossible to know 88 whether an element was found or not. 89 90 (fn PRED SEQUENCE &optional DEFAULT)") 91 (autoload 'seq-position "seq-25" "\ 92 Return the (zero-based) index of the first element in SEQUENCE \"equal\" to ELT. 93 \"Equality\" is defined by the function TESTFN, which defaults to `equal'. 94 95 (fn SEQUENCE ELT &optional TESTFN)") 96 (autoload 'seq-positions "seq-25" "\ 97 Return list of indices of SEQUENCE elements for which TESTFN returns non-nil. 98 99 TESTFN is a two-argument function which is called with each element of 100 SEQUENCE as the first argument and ELT as the second. 101 TESTFN defaults to `equal'. 102 103 The result is a list of (zero-based) indices. 104 105 (fn SEQUENCE ELT &optional TESTFN)") 106 (autoload 'seq-uniq "seq-25" "\ 107 Return a list of the elements of SEQUENCE with duplicates removed. 108 TESTFN is used to compare elements, and defaults to `equal'. 109 110 (fn SEQUENCE &optional TESTFN)") 111 (autoload 'seq-union "seq-25" "\ 112 Return a list of all the elements that appear in either SEQUENCE1 or SEQUENCE2. 113 \"Equality\" of elements is defined by the function TESTFN, which 114 defaults to `equal'. 115 116 (fn SEQUENCE1 SEQUENCE2 &optional TESTFN)") 117 (autoload 'seq-intersection "seq-25" "\ 118 Return a list of all the elements that appear in both SEQUENCE1 and SEQUENCE2. 119 \"Equality\" of elements is defined by the function TESTFN, which 120 defaults to `equal'. 121 122 (fn SEQUENCE1 SEQUENCE2 &optional TESTFN)") 123 (autoload 'seq-group-by "seq-25" "\ 124 Apply FUNCTION to each element of SEQUENCE. 125 Separate the elements of SEQUENCE into an alist using the results as 126 keys. Keys are compared using `equal'. 127 128 (fn FUNCTION SEQUENCE)") 129 (autoload 'seq-max "seq-25" "\ 130 Return the largest element of SEQUENCE. 131 SEQUENCE must be a sequence of numbers or markers. 132 133 (fn SEQUENCE)") 134 (autoload 'seq-random-elt "seq-25" "\ 135 Return a randomly chosen element from SEQUENCE. 136 Signal an error if SEQUENCE is empty. 137 138 (fn SEQUENCE)") 139 (register-definition-prefixes "seq-25" '("seq-")) 140 141 ;;; End of scraped data 142 143 (provide 'seq-autoloads) 144 145 ;; Local Variables: 146 ;; version-control: never 147 ;; no-byte-compile: t 148 ;; no-update-autoloads: t 149 ;; no-native-compile: t 150 ;; coding: utf-8-emacs-unix 151 ;; End: 152 153 ;;; seq-autoloads.el ends here