diff --git a/elpa/dash-20210826.1149/dash-autoloads.el b/elpa/dash-20220417.2250/dash-autoloads.el similarity index 100% rename from elpa/dash-20210826.1149/dash-autoloads.el rename to elpa/dash-20220417.2250/dash-autoloads.el diff --git a/elpa/dash-20210826.1149/dash-pkg.el b/elpa/dash-20220417.2250/dash-pkg.el similarity index 67% rename from elpa/dash-20210826.1149/dash-pkg.el rename to elpa/dash-20220417.2250/dash-pkg.el index 791c7b7..98425a8 100644 --- a/elpa/dash-20210826.1149/dash-pkg.el +++ b/elpa/dash-20220417.2250/dash-pkg.el @@ -1,6 +1,6 @@ -(define-package "dash" "20210826.1149" "A modern list library for Emacs" +(define-package "dash" "20220417.2250" "A modern list library for Emacs" '((emacs "24")) - :commit "39d067b9fbb2db65fc7a6938bfb21489ad990cb4" :authors + :commit "7fd71338dce041b352f84e7939f6966f4d379459" :authors '(("Magnar Sveen" . "magnars@gmail.com")) :maintainer '("Magnar Sveen" . "magnars@gmail.com") diff --git a/elpa/dash-20210826.1149/dash.el b/elpa/dash-20220417.2250/dash.el similarity index 96% rename from elpa/dash-20210826.1149/dash.el rename to elpa/dash-20220417.2250/dash.el index 6386c5f..26e1f8b 100644 --- a/elpa/dash-20210826.1149/dash.el +++ b/elpa/dash-20220417.2250/dash.el @@ -613,9 +613,9 @@ For a side-effecting variant, see also `-each-indexed'." (nreverse ,r)))) (defun -map-when (pred rep list) - "Return a new list where the elements in LIST that do not match the PRED function -are unchanged, and where the elements in LIST that do match the PRED function are mapped -through the REP function. + "Use PRED to conditionally apply REP to each item in LIST. +Return a copy of LIST where the items for which PRED returns nil +are unchanged, and the rest are mapped through the REP function. Alias: `-replace-where' @@ -626,7 +626,9 @@ See also: `-update-at'" (defalias '--replace-where '--map-when) (defun -map-first (pred rep list) - "Replace first item in LIST satisfying PRED with result of REP called on this item. + "Use PRED to determine the first item in LIST to call REP on. +Return a copy of LIST where the first item for which PRED returns +non-nil is replaced with the result of calling REP on that item. See also: `-map-when', `-replace-first'" (let (front) @@ -643,7 +645,9 @@ See also: `-map-when', `-replace-first'" `(-map-first (lambda (it) ,pred) (lambda (it) (ignore it) ,rep) ,list)) (defun -map-last (pred rep list) - "Replace last item in LIST satisfying PRED with result of REP called on this item. + "Use PRED to determine the last item in LIST to call REP on. +Return a copy of LIST where the last item for which PRED returns +non-nil is replaced with the result of calling REP on that item. See also: `-map-when', `-replace-last'" (nreverse (-map-first pred rep (reverse list)))) @@ -716,7 +720,7 @@ N is the length of the returned list." (defun -flatten (l) "Take a nested list L and return its contents as a single, flat list. -Note that because `nil' represents a list of zero elements (an +Note that because nil represents a list of zero elements (an empty list), any mention of nil in L will disappear after flattening. If you need to preserve nils, consider `-flatten-n' or map them to some unique symbol and then map them back. @@ -739,10 +743,7 @@ See also: `-flatten'" (setq list (apply #'append (mapcar #'-list list)))) list) -(defun -concat (&rest lists) - "Return a new list with the concatenation of the elements in the supplied LISTS." - (declare (pure t) (side-effect-free t)) - (apply 'append lists)) +(defalias '-concat #'append) (defalias '-copy 'copy-sequence "Create a shallow copy of LIST. @@ -802,7 +803,7 @@ is a dotted list. With no ARGS, return nil." This is like `cons', but operates on the end of list. -If ELEMENTS is non nil, append these to the list as well." +If any ELEMENTS are given, append them to the list as well." (-concat list (list elem) elements)) (defmacro --first (form list) @@ -982,7 +983,7 @@ See also: `-last-item'." `(and (--some ,form ,list) t)) (defun -any? (pred list) - "Return t if (PRED x) is non-nil for any x in LIST, else nil. + "Return t if (PRED X) is non-nil for any X in LIST, else nil. Alias: `-any-p', `-some?', `-some-p'" (--any? (funcall pred it) list)) @@ -1038,7 +1039,7 @@ This function's anaphoric counterpart is `--all?'." `(--all? (not ,form) ,list)) (defun -none? (pred list) - "Return t if (PRED x) is nil for all x in LIST, else nil. + "Return t if (PRED X) is nil for all X in LIST, else nil. Alias: `-none-p'" (--none? (funcall pred it) list)) @@ -1057,8 +1058,10 @@ Alias: `-none-p'" (---truthy? (and ,y ,n))))) (defun -only-some? (pred list) - "Return `t` if at least one item of LIST matches PRED and at least one item of LIST does not match PRED. -Return `nil` both if all items match the predicate or if none of the items match the predicate. + "Return t if different LIST items both satisfy and do not satisfy PRED. +That is, if PRED returns both nil for at least one item, and +non-nil for at least one other item in LIST. Return nil if all +items satisfy the predicate or none of them do. Alias: `-only-some-p'" (--only-some? (funcall pred it) list)) @@ -1217,11 +1220,15 @@ See also: `-replace'" (nconc (car split-list) (cons x (cdr (cadr split-list)))))) (defun -update-at (n func list) - "Return a list with element at Nth position in LIST replaced with `(func (nth n list))`. + "Use FUNC to update the Nth element of LIST. +Return a copy of LIST where the Nth element is replaced with the +result of calling FUNC on it. See also: `-map-when'" (let ((split-list (-split-at n list))) - (nconc (car split-list) (cons (funcall func (car (cadr split-list))) (cdr (cadr split-list)))))) + (nconc (car split-list) + (cons (funcall func (car (cadr split-list))) + (cdr (cadr split-list)))))) (defmacro --update-at (n form list) "Anaphoric version of `-update-at'." @@ -1270,7 +1277,14 @@ See also: `-remove-at', `-remove'" (list (nreverse ,r) ,l)))) (defun -split-with (pred list) - "Return a list of ((-take-while PRED LIST) (-drop-while PRED LIST)), in no more than one pass through the list." + "Split LIST into a prefix satisfying PRED, and the rest. +The first sublist is the prefix of LIST with successive elements +satisfying PRED, and the second sublist is the remaining elements +that do not. The result is like performing + + ((-take-while PRED LIST) (-drop-while PRED LIST)) + +but in no more than a single pass through LIST." (--split-with (funcall pred it) list)) (defmacro -split-on (item list) @@ -1318,11 +1332,16 @@ This function can be thought of as a generalization of (list (nreverse ,y) (nreverse ,n))))) (defun -separate (pred list) - "Return a list of ((-filter PRED LIST) (-remove PRED LIST)), in one pass through the list." + "Split LIST into two sublists based on whether items satisfy PRED. +The result is like performing + + ((-filter PRED LIST) (-remove PRED LIST)) + +but in a single pass through LIST." (--separate (funcall pred it) list)) (defun dash--partition-all-in-steps-reversed (n step list) - "Used by `-partition-all-in-steps' and `-partition-in-steps'." + "Like `-partition-all-in-steps', but the result is reversed." (when (< step 1) (signal 'wrong-type-argument `("Step size < 1 results in juicy infinite loops" ,step))) @@ -1333,19 +1352,20 @@ This function can be thought of as a generalization of result)) (defun -partition-all-in-steps (n step list) - "Return a new list with the items in LIST grouped into N-sized sublists at offsets STEP apart. -The last groups may contain less than N items." + "Partition LIST into sublists of length N that are STEP items apart. +Adjacent groups may overlap if N exceeds the STEP stride. +Trailing groups may contain less than N items." (declare (pure t) (side-effect-free t)) (nreverse (dash--partition-all-in-steps-reversed n step list))) (defun -partition-in-steps (n step list) - "Return a new list with the items in LIST grouped into N-sized sublists at offsets STEP apart. -If there are not enough items to make the last group N-sized, -those items are discarded." + "Partition LIST into sublists of length N that are STEP items apart. +Like `-partition-all-in-steps', but if there are not enough items +to make the last group N-sized, those items are discarded." (declare (pure t) (side-effect-free t)) (let ((result (dash--partition-all-in-steps-reversed n step list))) (while (and result (< (length (car result)) n)) - (!cdr result)) + (pop result)) (nreverse result))) (defun -partition-all (n list) @@ -1523,7 +1543,8 @@ elements of LIST. Keys are compared by `equal'." (defmacro --zip-with (form list1 list2) "Anaphoric form of `-zip-with'. -The elements in list1 are bound as symbol `it', the elements in list2 as symbol `other'." +Each element in turn of LIST1 is bound to `it', and of LIST2 to +`other', before evaluating FORM." (declare (debug (form form form))) (let ((r (make-symbol "result")) (l1 (make-symbol "list1")) @@ -1991,7 +2012,7 @@ MATCH-FORM is either a symbol, which gets bound to the respective value in source or another match form which gets destructured recursively. -If the cdr of last cons cell in the list is `nil', matching stops +If the cdr of last cons cell in the list is nil, matching stops there. SOURCE is a proper or improper list." @@ -2597,7 +2618,7 @@ Alias: `-uniq'" (let* ((len (length list)) (lut (and (> len 32) ;; Check that `-compare-fn' is a valid hash-table - ;; lookup function or `nil'. + ;; lookup function or nil. (memq -compare-fn '(nil equal eq eql)) (make-hash-table :test (or -compare-fn #'equal) :size len)))) @@ -2611,9 +2632,9 @@ Alias: `-uniq'" (defalias '-uniq '-distinct) (defun -union (list list2) - "Return a new list containing the elements of LIST and elements of LIST2 that are not in LIST. -The test for equality is done with `equal', -or with `-compare-fn' if that's non-nil." + "Return a new list of all elements appearing in either LIST1 or LIST2. +Equality is defined by the value of `-compare-fn' if non-nil; +otherwise `equal'." ;; We fall back to iteration implementation if the comparison ;; function isn't one of `eq', `eql' or `equal'. (let* ((result (reverse list)) @@ -2630,9 +2651,9 @@ or with `-compare-fn' if that's non-nil." (nreverse result))) (defun -intersection (list list2) - "Return a new list containing only the elements that are members of both LIST and LIST2. -The test for equality is done with `equal', -or with `-compare-fn' if that's non-nil." + "Return a new list of the elements appearing in both LIST1 and LIST2. +Equality is defined by the value of `-compare-fn' if non-nil; +otherwise `equal'." (--filter (-contains? list2 it) list)) (defun -difference (list list2) @@ -2880,7 +2901,7 @@ This is \"dual\" operation to `-reduce-r': while -reduce-r consumes a list to produce a single value, `-unfold' takes a seed value and builds a (potentially infinite!) list. -FUN should return `nil' to stop the generating process, or a +FUN should return nil to stop the generating process, or a cons (A . B), where A will be prepended to the result and B is the new seed." (let ((last (funcall fun seed)) r) @@ -3316,18 +3337,36 @@ In types: (a -> a) -> a -> a." re))))) (defun -prodfn (&rest fns) - "Take a list of n functions and return a function that takes a -list of length n, applying i-th function to i-th element of the -input list. Returns a list of length n. + "Return a function that applies each of FNS to each of a list of arguments. -In types (for n=2): ((a -> b), (c -> d)) -> (a, c) -> (b, d) +Takes a list of N functions and returns a function that takes a +list of length N, applying Ith function to Ith element of the +input list. Returns a list of length N. + +In types (for N=2): ((a -> b), (c -> d)) -> (a, c) -> (b, d) This function satisfies the following laws: - (-compose (-prodfn f g ...) (-prodfn f\\=' g\\=' ...)) = (-prodfn (-compose f f\\=') (-compose g g\\=') ...) - (-prodfn f g ...) = (-juxt (-compose f (-partial \\='nth 0)) (-compose g (-partial \\='nth 1)) ...) - (-compose (-prodfn f g ...) (-juxt f\\=' g\\=' ...)) = (-juxt (-compose f f\\=') (-compose g g\\=') ...) - (-compose (-partial \\='nth n) (-prod f1 f2 ...)) = (-compose fn (-partial \\='nth n))" + (-compose (-prodfn f g ...) + (-prodfn f\\=' g\\=' ...)) + = (-prodfn (-compose f f\\=') + (-compose g g\\=') + ...) + + (-prodfn f g ...) + = (-juxt (-compose f (-partial #\\='nth 0)) + (-compose g (-partial #\\='nth 1)) + ...) + + (-compose (-prodfn f g ...) + (-juxt f\\=' g\\=' ...)) + = (-juxt (-compose f f\\=') + (-compose g g\\=') + ...) + + (-compose (-partial #\\='nth n) + (-prod f1 f2 ...)) + = (-compose fn (-partial #\\='nth n))" (lambda (x) (-zip-with 'funcall fns x))) ;;; Font lock diff --git a/elpa/dash-20210826.1149/dash.info b/elpa/dash-20220417.2250/dash.info similarity index 92% rename from elpa/dash-20210826.1149/dash.info rename to elpa/dash-20220417.2250/dash.info index a6a2dc6..2741464 100644 --- a/elpa/dash-20210826.1149/dash.info +++ b/elpa/dash-20220417.2250/dash.info @@ -224,9 +224,9 @@ The results are collected in order and returned as a new list. ⇒ (1 4 9 16) -- Function: -map-when (pred rep list) - Return a new list where the elements in LIST that do not match the - PRED function are unchanged, and where the elements in LIST that do - match the PRED function are mapped through the REP function. + Use PRED to conditionally apply REP to each item in LIST. Return a + copy of LIST where the items for which PRED returns ‘nil’ are + unchanged, and the rest are mapped through the REP function. Alias: ‘-replace-where’ @@ -240,8 +240,9 @@ The results are collected in order and returned as a new list. ⇒ (1 17 3 4) -- Function: -map-first (pred rep list) - Replace first item in LIST satisfying PRED with result of REP - called on this item. + Use PRED to determine the first item in LIST to call REP on. + Return a copy of LIST where the first item for which PRED returns + non-‘nil’ is replaced with the result of calling REP on that item. See also: ‘-map-when’ (*note -map-when::), ‘-replace-first’ (*note -replace-first::) @@ -254,8 +255,9 @@ The results are collected in order and returned as a new list. ⇒ (1 17 3 2) -- Function: -map-last (pred rep list) - Replace last item in LIST satisfying PRED with result of REP called - on this item. + Use PRED to determine the last item in LIST to call REP on. Return + a copy of LIST where the last item for which PRED returns non-‘nil’ + is replaced with the result of calling REP on that item. See also: ‘-map-when’ (*note -map-when::), ‘-replace-last’ (*note -replace-last::) @@ -358,7 +360,7 @@ Functions returning a sublist of the original list. -- Function: -filter (pred list) Return a new list of the items in LIST for which PRED returns - non-nil. + non-‘nil’. Alias: ‘-select’. @@ -375,7 +377,8 @@ Functions returning a sublist of the original list. ⇒ (2 4) -- Function: -remove (pred list) - Return a new list of the items in LIST for which PRED returns nil. + Return a new list of the items in LIST for which PRED returns + ‘nil’. Alias: ‘-reject’. @@ -392,7 +395,7 @@ Functions returning a sublist of the original list. ⇒ (1 3) -- Function: -remove-first (pred list) - Remove the first item from LIST for which PRED returns non-nil. + Remove the first item from LIST for which PRED returns non-‘nil’. This is a non-destructive operation, but only the front of LIST leading up to the removed item is a copy; the rest is LIST’s original tail. If no item is removed, then the result is a @@ -413,8 +416,8 @@ Functions returning a sublist of the original list. ⇒ (1 2 3 5 6) -- Function: -remove-last (pred list) - Remove the last item from LIST for which PRED returns non-nil. The - result is a copy of LIST regardless of whether an element is + Remove the last item from LIST for which PRED returns non-‘nil’. + The result is a copy of LIST regardless of whether an element is removed. Alias: ‘-reject-last’. @@ -443,7 +446,7 @@ Functions returning a sublist of the original list. ⇒ ("alice" "eve") -- Function: -non-nil (list) - Return a copy of LIST with all nil items removed. + Return a copy of LIST with all ‘nil’ items removed. (-non-nil '(nil 1 nil 2 nil nil 3 4 nil 5 nil)) ⇒ (1 2 3 4 5) @@ -470,7 +473,8 @@ Functions returning a sublist of the original list. -- Function: -take (n list) Return a copy of the first N items in LIST. Return a copy of LIST - if it contains N items or fewer. Return nil if N is zero or less. + if it contains N items or fewer. Return ‘nil’ if N is zero or + less. See also: ‘-take-last’ (*note -take-last::). @@ -483,7 +487,7 @@ Functions returning a sublist of the original list. -- Function: -take-last (n list) Return a copy of the last N items of LIST in order. Return a copy - of LIST if it contains N items or fewer. Return nil if N is zero + of LIST if it contains N items or fewer. Return ‘nil’ if N is zero or less. See also: ‘-take’ (*note -take::). @@ -497,8 +501,8 @@ Functions returning a sublist of the original list. -- Function: -drop (n list) Return the tail (not a copy) of LIST without the first N items. - Return nil if LIST contains N items or fewer. Return LIST if N is - zero or less. + Return ‘nil’ if LIST contains N items or fewer. Return LIST if N + is zero or less. For another variant, see also ‘-drop-last’ (*note -drop-last::). @@ -511,8 +515,8 @@ Functions returning a sublist of the original list. -- Function: -drop-last (n list) Return a copy of LIST without its last N items. Return a copy of - LIST if N is zero or less. Return nil if LIST contains N items or - fewer. + LIST if N is zero or less. Return ‘nil’ if LIST contains N items + or fewer. See also: ‘-drop’ (*note -drop::). @@ -524,10 +528,10 @@ Functions returning a sublist of the original list. ⇒ (1 2 3 4 5) -- Function: -take-while (pred list) - Take successive items from LIST for which PRED returns non-nil. + Take successive items from LIST for which PRED returns non-‘nil’. PRED is a function of one argument. Return a new list of the successive elements from the start of LIST for which PRED returns - non-nil. + non-‘nil’. This function’s anaphoric counterpart is ‘--take-while’. @@ -541,9 +545,10 @@ Functions returning a sublist of the original list. ⇒ (1 2 3) -- Function: -drop-while (pred list) - Drop successive items from LIST for which PRED returns non-nil. + Drop successive items from LIST for which PRED returns non-‘nil’. PRED is a function of one argument. Return the tail (not a copy) - of LIST starting from its first element for which PRED returns nil. + of LIST starting from its first element for which PRED returns + ‘nil’. This function’s anaphoric counterpart is ‘--drop-while’. @@ -609,9 +614,9 @@ File: dash.info, Node: List to list, Next: Reductions, Prev: Sublist selectio Functions returning a modified copy of the input list. -- Function: -keep (fn list) - Return a new list of the non-nil results of applying FN to each + Return a new list of the non-‘nil’ results of applying FN to each item in LIST. Like ‘-filter’ (*note -filter::), but returns the - non-nil results of FN instead of the corresponding elements of + non-‘nil’ results of FN instead of the corresponding elements of LIST. Its anaphoric counterpart is ‘--keep’. @@ -623,9 +628,11 @@ Functions returning a modified copy of the input list. (--keep (and (> it 3) (* 10 it)) '(1 2 3 4 5 6)) ⇒ (40 50 60) - -- Function: -concat (&rest lists) - Return a new list with the concatenation of the elements in the - supplied LISTS. + -- Function: -concat (&rest sequences) + Concatenate all the arguments and make the result a list. The + result is a list whose elements are the elements of all the + arguments. Each argument may be a list, vector or string. The + last argument is not copied, just used as the tail of the new list. (-concat '(1)) ⇒ (1) @@ -639,7 +646,7 @@ Functions returning a modified copy of the input list. list. Note that because ‘nil’ represents a list of zero elements (an - empty list), any mention of nil in L will disappear after + empty list), any mention of ‘nil’ in L will disappear after flattening. If you need to preserve nils, consider ‘-flatten-n’ (*note -flatten-n::) or map them to some unique symbol and then map them back. @@ -734,8 +741,9 @@ Functions returning a modified copy of the input list. ⇒ (0 1 2 3 9 5) -- Function: -update-at (n func list) - Return a list with element at Nth position in LIST replaced with - ‘(func (nth n list))‘. + Use FUNC to update the Nth element of LIST. Return a copy of LIST + where the Nth element is replaced with the result of calling FUNC + on it. See also: ‘-map-when’ (*note -map-when::) @@ -946,7 +954,7 @@ Functions reducing lists to a single value (which may also be a list). ⇒ ("(FN 1 (FN 2 3))" "(FN 2 3)" 3) -- Function: -count (pred list) - Counts the number of items in LIST where (PRED item) is non-nil. + Counts the number of items in LIST where (PRED item) is non-‘nil’. (-count 'even? '(1 2 3 4 5)) ⇒ 2 @@ -1136,8 +1144,8 @@ File: dash.info, Node: Predicates, Next: Partitioning, Prev: Unfolding, Up: Reductions of one or more lists to a boolean value. -- Function: -some (pred list) - Return (PRED x) for the first LIST item where (PRED x) is non-nil, - else nil. + Return (PRED x) for the first LIST item where (PRED x) is + non-‘nil’, else ‘nil’. Alias: ‘-any’. @@ -1151,13 +1159,13 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -every (pred list) - Return non-nil if PRED returns non-nil for all items in LIST. If - so, return the last such result of PRED. Otherwise, once an item - is reached for which PRED returns nil, return nil without calling - PRED on any further LIST elements. + Return non-‘nil’ if PRED returns non-‘nil’ for all items in LIST. + If so, return the last such result of PRED. Otherwise, once an + item is reached for which PRED returns ‘nil’, return ‘nil’ without + calling PRED on any further LIST elements. This function is like ‘-every-p’, but on success returns the last - non-nil result of PRED instead of just t. + non-‘nil’ result of PRED instead of just ‘t’. This function’s anaphoric counterpart is ‘--every’. @@ -1169,7 +1177,7 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -any? (pred list) - Return t if (PRED x) is non-nil for any x in LIST, else nil. + Return ‘t’ if (PRED X) is non-‘nil’ for any X in LIST, else ‘nil’. Alias: ‘-any-p’, ‘-some?’, ‘-some-p’ @@ -1181,13 +1189,13 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -all? (pred list) - Return t if (PRED X) is non-nil for all X in LIST, else nil. In - the latter case, stop after the first X for which (PRED X) is nil, - without calling PRED on any subsequent elements of LIST. + Return ‘t’ if (PRED X) is non-‘nil’ for all X in LIST, else ‘nil’. + In the latter case, stop after the first X for which (PRED X) is + ‘nil’, without calling PRED on any subsequent elements of LIST. The similar function ‘-every’ (*note -every::) is more widely - useful, since it returns the last non-nil result of PRED instead of - just t on success. + useful, since it returns the last non-‘nil’ result of PRED instead + of just ‘t’ on success. Alias: ‘-all-p’, ‘-every-p’, ‘-every?’. @@ -1201,7 +1209,7 @@ Reductions of one or more lists to a boolean value. ⇒ t -- Function: -none? (pred list) - Return t if (PRED x) is nil for all x in LIST, else nil. + Return ‘t’ if (PRED X) is ‘nil’ for all X in LIST, else ‘nil’. Alias: ‘-none-p’ @@ -1213,10 +1221,10 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -only-some? (pred list) - Return ‘t‘ if at least one item of LIST matches PRED and at least - one item of LIST does not match PRED. Return ‘nil‘ both if all - items match the predicate or if none of the items match the - predicate. + Return ‘t’ if different LIST items both satisfy and do not satisfy + PRED. That is, if PRED returns both ‘nil’ for at least one item, + and non-‘nil’ for at least one other item in LIST. Return ‘nil’ if + all items satisfy the predicate or none of them do. Alias: ‘-only-some-p’ @@ -1228,10 +1236,10 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -contains? (list element) - Return non-nil if LIST contains ELEMENT. + Return non-‘nil’ if LIST contains ELEMENT. The test for equality is done with ‘equal’, or with ‘-compare-fn’ - if that’s non-nil. + if that’s non-‘nil’. Alias: ‘-contains-p’ @@ -1257,7 +1265,7 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -is-prefix? (prefix list) - Return non-nil if PREFIX is a prefix of LIST. + Return non-‘nil’ if PREFIX is a prefix of LIST. Alias: ‘-is-prefix-p’. @@ -1269,7 +1277,7 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -is-suffix? (suffix list) - Return non-nil if SUFFIX is a suffix of LIST. + Return non-‘nil’ if SUFFIX is a suffix of LIST. Alias: ‘-is-suffix-p’. @@ -1281,7 +1289,7 @@ Reductions of one or more lists to a boolean value. ⇒ nil -- Function: -is-infix? (infix list) - Return non-nil if INFIX is infix of LIST. + Return non-‘nil’ if INFIX is infix of LIST. This operation runs in O(n^2) time @@ -1295,7 +1303,7 @@ Reductions of one or more lists to a boolean value. ⇒ t -- Function: -cons-pair? (obj) - Return non-nil if OBJ is a true cons pair. That is, a cons (A . + Return non-‘nil’ if OBJ is a true cons pair. That is, a cons (A . B) where B is not a list. Alias: ‘-cons-pair-p’. @@ -1331,8 +1339,14 @@ Functions partitioning the input list into a list of lists. ⇒ (nil (1 2 3 4 5)) -- Function: -split-with (pred list) - Return a list of ((-take-while PRED LIST) (-drop-while PRED LIST)), - in no more than one pass through the list. + Split LIST into a prefix satisfying PRED, and the rest. The first + sublist is the prefix of LIST with successive elements satisfying + PRED, and the second sublist is the remaining elements that do not. + The result is like performing + + ((-take-while PRED LIST) (-drop-while PRED LIST)) + + but in no more than a single pass through LIST. (-split-with 'even? '(1 2 3 4)) ⇒ (nil (1 2 3 4)) @@ -1360,7 +1374,7 @@ Functions partitioning the input list into a list of lists. ⇒ (("a" "b") ("d" "e")) -- Function: -split-when (fn list) - Split the LIST on each element where FN returns non-nil. + Split the LIST on each element where FN returns non-‘nil’. Unlike ‘-partition-by’ (*note -partition-by::), the "matched" element is discarded from the results. Empty lists are also @@ -1377,8 +1391,12 @@ Functions partitioning the input list into a list of lists. ⇒ ((a b) (c d) (args)) -- Function: -separate (pred list) - Return a list of ((-filter PRED LIST) (-remove PRED LIST)), in one - pass through the list. + Split LIST into two sublists based on whether items satisfy PRED. + The result is like performing + + ((-filter PRED LIST) (-remove PRED LIST)) + + but in a single pass through LIST. (-separate (lambda (num) (= 0 (% num 2))) '(1 2 3 4 5 6 7)) ⇒ ((2 4 6) (1 3 5 7)) @@ -1411,9 +1429,10 @@ Functions partitioning the input list into a list of lists. ⇒ ((1 2 3) (4 5 6) (7)) -- Function: -partition-in-steps (n step list) - Return a new list with the items in LIST grouped into N-sized - sublists at offsets STEP apart. If there are not enough items to - make the last group N-sized, those items are discarded. + Partition LIST into sublists of length N that are STEP items apart. + Like ‘-partition-all-in-steps’ (*note -partition-all-in-steps::), + but if there are not enough items to make the last group N-sized, + those items are discarded. (-partition-in-steps 2 1 '(1 2 3 4)) ⇒ ((1 2) (2 3) (3 4)) @@ -1423,9 +1442,9 @@ Functions partitioning the input list into a list of lists. ⇒ ((1 2 3) (3 4 5)) -- Function: -partition-all-in-steps (n step list) - Return a new list with the items in LIST grouped into N-sized - sublists at offsets STEP apart. The last groups may contain less - than N items. + Partition LIST into sublists of length N that are STEP items apart. + Adjacent groups may overlap if N exceeds the STEP stride. Trailing + groups may contain less than N items. (-partition-all-in-steps 2 1 '(1 2 3 4)) ⇒ ((1 2) (2 3) (3 4) (4)) @@ -1459,7 +1478,7 @@ Functions partitioning the input list into a list of lists. ⇒ ((2 1 1 1) (4 1 3 5) (6 6 1)) -- Function: -partition-after-pred (pred list) - Partition LIST after each element for which PRED returns non-nil. + Partition LIST after each element for which PRED returns non-‘nil’. This function’s anaphoric counterpart is ‘--partition-after-pred’. @@ -1523,7 +1542,7 @@ predicates. -- Function: -elem-index (elem list) Return the index of the first element in the given LIST which is - equal to the query element ELEM, or nil if there is no such + equal to the query element ELEM, or ‘nil’ if there is no such element. (-elem-index 2 '(6 7 8 2 3 4)) @@ -1546,8 +1565,8 @@ predicates. -- Function: -find-index (pred list) Take a predicate PRED and a LIST and return the index of the first - element in the list satisfying the predicate, or nil if there is no - such element. + element in the list satisfying the predicate, or ‘nil’ if there is + no such element. See also ‘-first’ (*note -first::). @@ -1560,8 +1579,8 @@ predicates. -- Function: -find-last-index (pred list) Take a predicate PRED and a LIST and return the index of the last - element in the list satisfying the predicate, or nil if there is no - such element. + element in the list satisfying the predicate, or ‘nil’ if there is + no such element. See also ‘-last’ (*note -last::). @@ -1612,9 +1631,9 @@ File: dash.info, Node: Set operations, Next: Other list operations, Prev: Ind Operations pretending lists are sets. -- Function: -union (list list2) - Return a new list containing the elements of LIST and elements of - LIST2 that are not in LIST. The test for equality is done with - ‘equal’, or with ‘-compare-fn’ if that’s non-nil. + Return a new list of all elements appearing in either LIST1 or + LIST2. Equality is defined by the value of ‘-compare-fn’ if + non-‘nil’; otherwise ‘equal’. (-union '(1 2 3) '(3 4 5)) ⇒ (1 2 3 4 5) @@ -1626,7 +1645,7 @@ Operations pretending lists are sets. -- Function: -difference (list list2) Return a new list with only the members of LIST that are not in LIST2. The test for equality is done with ‘equal’, or with - ‘-compare-fn’ if that’s non-nil. + ‘-compare-fn’ if that’s non-‘nil’. (-difference () ()) ⇒ () @@ -1636,9 +1655,9 @@ Operations pretending lists are sets. ⇒ (1 2) -- Function: -intersection (list list2) - Return a new list containing only the elements that are members of - both LIST and LIST2. The test for equality is done with ‘equal’, - or with ‘-compare-fn’ if that’s non-nil. + Return a new list of the elements appearing in both LIST1 and + LIST2. Equality is defined by the value of ‘-compare-fn’ if + non-‘nil’; otherwise ‘equal’. (-intersection () ()) ⇒ () @@ -1668,7 +1687,7 @@ Operations pretending lists are sets. -- Function: -distinct (list) Return a new list with all duplicates removed. The test for equality is done with ‘equal’, or with ‘-compare-fn’ if that’s - non-nil. + non-‘nil’. Alias: ‘-uniq’ @@ -1700,7 +1719,7 @@ Other list functions not fit to be classified elsewhere. -- Function: -repeat (n x) Return a new list of length N with each element being X. Return - nil if N is less than 1. + ‘nil’ if N is less than 1. (-repeat 3 :a) ⇒ (:a :a :a) @@ -1713,7 +1732,7 @@ Other list functions not fit to be classified elsewhere. Make a new list from the elements of ARGS. The last 2 elements of ARGS are used as the final cons of the result, so if the final element of ARGS is not a list, the result is a dotted list. With - no ARGS, return nil. + no ARGS, return ‘nil’. (-cons* 1 2) ⇒ (1 . 2) @@ -1727,7 +1746,7 @@ Other list functions not fit to be classified elsewhere. This is like ‘cons’, but operates on the end of list. - If ELEMENTS is non nil, append these to the list as well. + If any ELEMENTS are given, append them to the list as well. (-snoc '(1 2 3) 4) ⇒ (1 2 3 4) @@ -1926,8 +1945,8 @@ Other list functions not fit to be classified elsewhere. ⇒ ((1 1 1) (2 1 1) (1 2 1) (2 2 1) (1 1 2) (2 1 2) (1 2 2) (2 2 2)) -- Function: -first (pred list) - Return the first item in LIST for which PRED returns non-nil. - Return nil if no such element is found. To get the first item in + Return the first item in LIST for which PRED returns non-‘nil’. + Return ‘nil’ if no such element is found. To get the first item in the list no questions asked, use ‘car’. Alias: ‘-find’. @@ -1942,7 +1961,7 @@ Other list functions not fit to be classified elsewhere. ⇒ 3 -- Function: -last (pred list) - Return the last x in LIST where (PRED x) is non-nil, else nil. + Return the last x in LIST where (PRED x) is non-‘nil’, else ‘nil’. (-last 'even? '(1 2 3 4 5 6 3 3 3)) ⇒ 6 @@ -1952,7 +1971,7 @@ Other list functions not fit to be classified elsewhere. ⇒ "short" -- Function: -first-item (list) - Return the first item of LIST, or nil on an empty list. + Return the first item of LIST, or ‘nil’ on an empty list. See also: ‘-second-item’ (*note -second-item::), ‘-last-item’ (*note -last-item::). @@ -1965,7 +1984,7 @@ Other list functions not fit to be classified elsewhere. ⇒ (5 2 3) -- Function: -second-item (list) - Return the second item of LIST, or nil if LIST is too short. + Return the second item of LIST, or ‘nil’ if LIST is too short. See also: ‘-third-item’ (*note -third-item::). @@ -1975,7 +1994,7 @@ Other list functions not fit to be classified elsewhere. ⇒ nil -- Function: -third-item (list) - Return the third item of LIST, or nil if LIST is too short. + Return the third item of LIST, or ‘nil’ if LIST is too short. See also: ‘-fourth-item’ (*note -fourth-item::). @@ -1985,7 +2004,7 @@ Other list functions not fit to be classified elsewhere. ⇒ nil -- Function: -fourth-item (list) - Return the fourth item of LIST, or nil if LIST is too short. + Return the fourth item of LIST, or ‘nil’ if LIST is too short. See also: ‘-fifth-item’ (*note -fifth-item::). @@ -1995,7 +2014,7 @@ Other list functions not fit to be classified elsewhere. ⇒ nil -- Function: -fifth-item (list) - Return the fifth item of LIST, or nil if LIST is too short. + Return the fifth item of LIST, or ‘nil’ if LIST is too short. See also: ‘-last-item’ (*note -last-item::). @@ -2005,7 +2024,7 @@ Other list functions not fit to be classified elsewhere. ⇒ nil -- Function: -last-item (list) - Return the last item of LIST, or nil on an empty list. + Return the last item of LIST, or ‘nil’ on an empty list. (-last-item '(1 2 3)) ⇒ 3 @@ -2027,8 +2046,8 @@ Other list functions not fit to be classified elsewhere. -- Function: -sort (comparator list) Sort LIST, stably, comparing elements using COMPARATOR. Return the sorted list. LIST is NOT modified by side effects. COMPARATOR is - called with two elements of LIST, and should return non-nil if the - first element should sort before the second. + called with two elements of LIST, and should return non-‘nil’ if + the first element should sort before the second. (-sort '< '(3 1 2)) ⇒ (1 2 3) @@ -2076,7 +2095,7 @@ Functions pretending lists are trees. Return a sequence of the nodes in TREE, in depth-first search order. - BRANCH is a predicate of one argument that returns non-nil if the + BRANCH is a predicate of one argument that returns non-‘nil’ if the passed argument is a branch, that is, a node that can have children. @@ -2106,8 +2125,9 @@ Functions pretending lists are trees. -- Function: -tree-map-nodes (pred fun tree) Call FUN on each node of TREE that satisfies PRED. - If PRED returns nil, continue descending down this node. If PRED - returns non-nil, apply FUN to this node and do not descend further. + If PRED returns ‘nil’, continue descending down this node. If PRED + returns non-‘nil’, apply FUN to this node and do not descend + further. (-tree-map-nodes 'vectorp (lambda (x) (-sum (append x nil))) '(1 [2 3] 4 (5 [6 7] 8))) ⇒ (1 5 4 (5 13 8)) @@ -2257,8 +2277,8 @@ readability. ⇒ 3 -- Macro: -some-> (x &optional form &rest more) - When expr is non-nil, thread it through the first form (via ‘->’ - (*note ->::)), and when that result is non-nil, through the next + When expr is non-‘nil’, thread it through the first form (via ‘->’ + (*note ->::)), and when that result is non-‘nil’, through the next form, etc. (-some-> '(2 3 5)) @@ -2269,8 +2289,8 @@ readability. ⇒ nil -- Macro: -some->> (x &optional form &rest more) - When expr is non-nil, thread it through the first form (via ‘->>’ - (*note ->>::)), and when that result is non-nil, through the next + When expr is non-‘nil’, thread it through the first form (via ‘->>’ + (*note ->>::)), and when that result is non-‘nil’, through the next form, etc. (-some->> '(1 2 3) (-map 'square)) @@ -2282,9 +2302,9 @@ readability. -- Macro: -some--> (expr &rest forms) Thread EXPR through FORMS via ‘-->’ (*note -->::), while the result - is non-nil. When EXPR evaluates to non-nil, thread the result - through the first of FORMS, and when that result is non-nil, thread - it through the next form, etc. + is non-‘nil’. When EXPR evaluates to non-‘nil’, thread the result + through the first of FORMS, and when that result is non-‘nil’, + thread it through the next form, etc. (-some--> "def" (concat "abc" it "ghi")) ⇒ "abcdefghi" @@ -2316,7 +2336,7 @@ Macros that combine ‘let’ and ‘let*’ with destructuring and flow control. -- Macro: -when-let ((var val) &rest body) - If VAL evaluates to non-nil, bind it to VAR and execute body. + If VAL evaluates to non-‘nil’, bind it to VAR and execute body. Note: binding is done according to ‘-let’ (*note -let::). @@ -2333,7 +2353,7 @@ control. Note: binding is done according to ‘-let*’ (*note -let*::). VALS are evaluated sequentially, and evaluation stops after the first - nil VAL is encountered. + ‘nil’ VAL is encountered. (-when-let* ((x 5) (y 3) (z (+ y 4))) (+ x y z)) ⇒ 15 @@ -2341,8 +2361,8 @@ control. ⇒ nil -- Macro: -if-let ((var val) then &rest else) - If VAL evaluates to non-nil, bind it to VAR and do THEN, otherwise - do ELSE. + If VAL evaluates to non-‘nil’, bind it to VAR and do THEN, + otherwise do ELSE. Note: binding is done according to ‘-let’ (*note -let::). @@ -2358,7 +2378,7 @@ control. Note: binding is done according to ‘-let*’ (*note -let*::). VALS are evaluated sequentially, and evaluation stops after the first - nil VAL is encountered. + ‘nil’ VAL is encountered. (-if-let* ((x 5) (y 3) (z 7)) (+ x y z) "foo") ⇒ 15 @@ -2434,15 +2454,15 @@ control. Key/value stores: (&plist key0 a0 ... keyN aN) - bind value mapped by keyK in the - SOURCE plist to aK. If the value is not found, aK is nil. Uses + SOURCE plist to aK. If the value is not found, aK is ‘nil’. Uses ‘plist-get’ to fetch values. (&alist key0 a0 ... keyN aN) - bind value mapped by keyK in the - SOURCE alist to aK. If the value is not found, aK is nil. Uses + SOURCE alist to aK. If the value is not found, aK is ‘nil’. Uses ‘assoc’ to fetch values. (&hash key0 a0 ... keyN aN) - bind value mapped by keyK in the - SOURCE hash table to aK. If the value is not found, aK is nil. + SOURCE hash table to aK. If the value is not found, aK is ‘nil’. Uses ‘gethash’ to fetch values. Further, special keyword &keys supports "inline" matching of @@ -2610,7 +2630,7 @@ File: dash.info, Node: Side effects, Next: Destructive operations, Prev: Bind Functions iterating over lists for side effect only. -- Function: -each (list fn) - Call FN on each element of LIST. Return nil; this function is + Call FN on each element of LIST. Return ‘nil’; this function is intended for side effects. Its anaphoric counterpart is ‘--each’. @@ -2626,9 +2646,9 @@ Functions iterating over lists for side effect only. ⇒ nil -- Function: -each-while (list pred fn) - Call FN on each ITEM in LIST, while (PRED ITEM) is non-nil. Once - an ITEM is reached for which PRED returns nil, FN is no longer - called. Return nil; this function is intended for side effects. + Call FN on each ITEM in LIST, while (PRED ITEM) is non-‘nil’. Once + an ITEM is reached for which PRED returns ‘nil’, FN is no longer + called. Return ‘nil’; this function is intended for side effects. Its anaphoric counterpart is ‘--each-while’. @@ -2641,7 +2661,7 @@ Functions iterating over lists for side effect only. -- Function: -each-indexed (list fn) Call FN on each index and element of LIST. For each ITEM at INDEX - in LIST, call (funcall FN INDEX ITEM). Return nil; this function + in LIST, call (funcall FN INDEX ITEM). Return ‘nil’; this function is intended for side effects. See also: ‘-map-indexed’ (*note -map-indexed::). @@ -2654,7 +2674,7 @@ Functions iterating over lists for side effect only. ⇒ () -- Function: -each-r (list fn) - Call FN on each element of LIST in reversed order. Return nil; + Call FN on each element of LIST in reversed order. Return ‘nil’; this function is intended for side effects. Its anaphoric counterpart is ‘--each-r’. @@ -2668,9 +2688,9 @@ Functions iterating over lists for side effect only. -- Function: -each-r-while (list pred fn) Call FN on each ITEM in reversed LIST, while (PRED ITEM) is - non-nil. Once an ITEM is reached for which PRED returns nil, FN is - no longer called. Return nil; this function is intended for side - effects. + non-‘nil’. Once an ITEM is reached for which PRED returns ‘nil’, + FN is no longer called. Return ‘nil’; this function is intended + for side effects. Its anaphoric counterpart is ‘--each-r-while’. @@ -2874,8 +2894,8 @@ Functions that manipulate and compose other functions. -- Function: -not (pred) Return a predicate that negates the result of PRED. The returned - predicate passes its arguments to PRED. If PRED returns nil, the - result is non-nil; otherwise the result is nil. + predicate passes its arguments to PRED. If PRED returns ‘nil’, the + result is non-‘nil’; otherwise the result is ‘nil’. See also: ‘-andfn’ (*note -andfn::) and ‘-orfn’ (*note -orfn::). @@ -2887,12 +2907,12 @@ Functions that manipulate and compose other functions. ⇒ (1 2 3 4) -- Function: -orfn (&rest preds) - Return a predicate that returns the first non-nil result of PREDS. - The returned predicate takes a variable number of arguments, passes - them to each predicate in PREDS in turn until one of them returns - non-nil, and returns that non-nil result without calling the - remaining PREDS. If all PREDS return nil, or if no PREDS are - given, the returned predicate returns nil. + Return a predicate that returns the first non-‘nil’ result of + PREDS. The returned predicate takes a variable number of + arguments, passes them to each predicate in PREDS in turn until one + of them returns non-‘nil’, and returns that non-‘nil’ result + without calling the remaining PREDS. If all PREDS return ‘nil’, or + if no PREDS are given, the returned predicate returns ‘nil’. See also: ‘-andfn’ (*note -andfn::) and ‘-not’ (*note -not::). @@ -2904,12 +2924,12 @@ Functions that manipulate and compose other functions. ⇒ t -- Function: -andfn (&rest preds) - Return a predicate that returns non-nil if all PREDS do so. The + Return a predicate that returns non-‘nil’ if all PREDS do so. The returned predicate P takes a variable number of arguments and passes them to each predicate in PREDS in turn. If any one of - PREDS returns nil, P also returns nil without calling the remaining - PREDS. If all PREDS return non-nil, P returns the last such value. - If no PREDS are given, P always returns non-nil. + PREDS returns ‘nil’, P also returns ‘nil’ without calling the + remaining PREDS. If all PREDS return non-‘nil’, P returns the last + such value. If no PREDS are given, P always returns non-‘nil’. See also: ‘-orfn’ (*note -orfn::) and ‘-not’ (*note -not::). @@ -2956,13 +2976,13 @@ Functions that manipulate and compose other functions. For functions over the floating point numbers, it may be necessary to provide an appropriate approximate comparison test. - 2. HALT-TEST returns a non-nil value. HALT-TEST defaults to a - simple counter that returns t after ‘-fixfn-max-iterations’, to + 2. HALT-TEST returns a non-‘nil’ value. HALT-TEST defaults to a + simple counter that returns ‘t’ after ‘-fixfn-max-iterations’, to guard against infinite iteration. Otherwise, HALT-TEST must be a function that accepts a single argument, the current value of X, - and returns non-nil as long as iteration should continue. In this - way, a more sophisticated convergence test may be supplied by the - caller. + and returns non-‘nil’ as long as iteration should continue. In + this way, a more sophisticated convergence test may be supplied by + the caller. The return value of the lambda is either the fixpoint or, if iteration halted before converging, a cons with car ‘halted’ and @@ -2978,20 +2998,28 @@ Functions that manipulate and compose other functions. ⇒ (halted . t) -- Function: -prodfn (&rest fns) - Take a list of n functions and return a function that takes a list - of length n, applying i-th function to i-th element of the input - list. Returns a list of length n. + Return a function that applies each of FNS to each of a list of + arguments. - In types (for n=2): ((a -> b), (c -> d)) -> (a, c) -> (b, d) + Takes a list of N functions and returns a function that takes a + list of length N, applying Ith function to Ith element of the input + list. Returns a list of length N. + + In types (for N=2): ((a -> b), (c -> d)) -> (a, c) -> (b, d) This function satisfies the following laws: (-compose (-prodfn f g ...) (-prodfn f’ g’ ...)) = (-prodfn - (-compose f f’) (-compose g g’) ...) (-prodfn f g ...) = (-juxt - (-compose f (-partial ’nth 0)) (-compose g (-partial ’nth 1)) ...) + (-compose f f’) (-compose g g’) ...) + + (-prodfn f g ...) = (-juxt (-compose f (-partial #’nth 0)) + (-compose g (-partial #’nth 1)) ...) + (-compose (-prodfn f g ...) (-juxt f’ g’ ...)) = (-juxt (-compose f - f’) (-compose g g’) ...) (-compose (-partial ’nth n) (-prod f1 f2 - ...)) = (-compose fn (-partial ’nth n)) + f’) (-compose g g’) ...) + + (-compose (-partial #’nth n) (-prod f1 f2 ...)) = (-compose fn + (-partial #’nth n)) (funcall (-prodfn '1+ '1- 'number-to-string) '(1 2 3)) ⇒ (2 1 "3") @@ -4300,14 +4328,14 @@ Index * -all?: Predicates. (line 53) * -andfn: Function combinators. (line 184) -* -annotate: Maps. (line 84) +* -annotate: Maps. (line 86) * -any?: Predicates. (line 41) * -applify: Function combinators. (line 63) * -as->: Threading macros. (line 49) * -butlast: Other list operations. (line 335) -* -clone: Tree operations. (line 122) +* -clone: Tree operations. (line 123) * -common-prefix: Reductions. (line 242) * -common-suffix: Reductions. (line 252) * -compose: Function combinators. @@ -4319,7 +4347,7 @@ Index * -const: Function combinators. (line 128) * -contains?: Predicates. (line 100) -* -copy: Maps. (line 139) +* -copy: Maps. (line 141) * -count: Reductions. (line 172) * -cut: Function combinators. (line 140) @@ -4329,9 +4357,9 @@ Index * -distinct: Set operations. (line 62) * -dotimes: Side effects. (line 80) * -doto: Threading macros. (line 99) -* -drop: Sublist selection. (line 147) -* -drop-last: Sublist selection. (line 161) -* -drop-while: Sublist selection. (line 192) +* -drop: Sublist selection. (line 149) +* -drop-last: Sublist selection. (line 163) +* -drop-while: Sublist selection. (line 194) * -each: Side effects. (line 8) * -each-indexed: Side effects. (line 38) * -each-r: Side effects. (line 52) @@ -4354,19 +4382,19 @@ Index (line 375) * -fixfn: Function combinators. (line 224) -* -flatten: List to list. (line 34) -* -flatten-n: List to list. (line 56) +* -flatten: List to list. (line 36) +* -flatten-n: List to list. (line 58) * -flip: Function combinators. (line 95) * -fourth-item: Other list operations. (line 305) * -grade-down: Indexing. (line 81) * -grade-up: Indexing. (line 71) -* -group-by: Partitioning. (line 194) +* -group-by: Partitioning. (line 205) * -if-let: Binding. (line 34) * -if-let*: Binding. (line 45) * -inits: Reductions. (line 222) -* -insert-at: List to list. (line 110) +* -insert-at: List to list. (line 112) * -interleave: Other list operations. (line 67) * -interpose: Other list operations. @@ -4394,15 +4422,15 @@ Index (line 358) * -map: Maps. (line 10) * -map-first: Maps. (line 38) -* -map-indexed: Maps. (line 66) -* -map-last: Maps. (line 52) +* -map-indexed: Maps. (line 68) +* -map-last: Maps. (line 53) * -map-when: Maps. (line 22) -* -mapcat: Maps. (line 128) +* -mapcat: Maps. (line 130) * -max: Reductions. (line 286) * -max-by: Reductions. (line 296) * -min: Reductions. (line 262) * -min-by: Reductions. (line 272) -* -non-nil: Sublist selection. (line 94) +* -non-nil: Sublist selection. (line 95) * -none?: Predicates. (line 73) * -not: Function combinators. (line 153) @@ -4415,16 +4443,16 @@ Index (line 191) * -partial: Function combinators. (line 8) -* -partition: Partitioning. (line 80) -* -partition-after-item: Partitioning. (line 184) -* -partition-after-pred: Partitioning. (line 151) -* -partition-all: Partitioning. (line 92) -* -partition-all-in-steps: Partitioning. (line 115) -* -partition-before-item: Partitioning. (line 174) -* -partition-before-pred: Partitioning. (line 163) -* -partition-by: Partitioning. (line 127) -* -partition-by-header: Partitioning. (line 138) -* -partition-in-steps: Partitioning. (line 103) +* -partition: Partitioning. (line 90) +* -partition-after-item: Partitioning. (line 195) +* -partition-after-pred: Partitioning. (line 162) +* -partition-all: Partitioning. (line 102) +* -partition-all-in-steps: Partitioning. (line 126) +* -partition-before-item: Partitioning. (line 185) +* -partition-before-pred: Partitioning. (line 174) +* -partition-by: Partitioning. (line 138) +* -partition-by-header: Partitioning. (line 149) +* -partition-in-steps: Partitioning. (line 113) * -permutations: Set operations. (line 52) * -powerset: Set operations. (line 44) * -prodfn: Function combinators. @@ -4439,17 +4467,17 @@ Index * -reductions-r: Reductions. (line 154) * -reductions-r-from: Reductions. (line 118) * -remove: Sublist selection. (line 26) -* -remove-at: List to list. (line 146) -* -remove-at-indices: List to list. (line 159) -* -remove-first: Sublist selection. (line 43) -* -remove-item: Sublist selection. (line 83) -* -remove-last: Sublist selection. (line 64) +* -remove-at: List to list. (line 149) +* -remove-at-indices: List to list. (line 162) +* -remove-first: Sublist selection. (line 44) +* -remove-item: Sublist selection. (line 84) +* -remove-last: Sublist selection. (line 65) * -repeat: Other list operations. (line 19) -* -replace: List to list. (line 68) -* -replace-at: List to list. (line 121) -* -replace-first: List to list. (line 82) -* -replace-last: List to list. (line 96) +* -replace: List to list. (line 70) +* -replace-at: List to list. (line 123) +* -replace-first: List to list. (line 84) +* -replace-last: List to list. (line 98) * -rotate: Other list operations. (line 8) * -rotate-args: Function combinators. @@ -4461,12 +4489,12 @@ Index * -same-items?: Predicates. (line 115) * -second-item: Other list operations. (line 285) -* -select-by-indices: Sublist selection. (line 208) -* -select-column: Sublist selection. (line 238) -* -select-columns: Sublist selection. (line 219) -* -separate: Partitioning. (line 69) +* -select-by-indices: Sublist selection. (line 211) +* -select-column: Sublist selection. (line 241) +* -select-columns: Sublist selection. (line 222) +* -separate: Partitioning. (line 75) * -setq: Binding. (line 270) -* -slice: Sublist selection. (line 104) +* -slice: Sublist selection. (line 105) * -snoc: Other list operations. (line 43) * -some: Predicates. (line 8) @@ -4475,11 +4503,11 @@ Index * -some->>: Threading macros. (line 74) * -sort: Other list operations. (line 345) -* -splice: Maps. (line 95) -* -splice-list: Maps. (line 115) +* -splice: Maps. (line 97) +* -splice-list: Maps. (line 117) * -split-at: Partitioning. (line 8) -* -split-on: Partitioning. (line 34) -* -split-when: Partitioning. (line 52) +* -split-on: Partitioning. (line 40) +* -split-when: Partitioning. (line 58) * -split-with: Partitioning. (line 23) * -sum: Reductions. (line 180) * -table: Other list operations. @@ -4487,23 +4515,23 @@ Index * -table-flat: Other list operations. (line 221) * -tails: Reductions. (line 232) -* -take: Sublist selection. (line 120) -* -take-last: Sublist selection. (line 133) -* -take-while: Sublist selection. (line 175) +* -take: Sublist selection. (line 121) +* -take-last: Sublist selection. (line 135) +* -take-while: Sublist selection. (line 177) * -third-item: Other list operations. (line 295) * -tree-map: Tree operations. (line 28) * -tree-map-nodes: Tree operations. (line 39) -* -tree-mapreduce: Tree operations. (line 84) -* -tree-mapreduce-from: Tree operations. (line 103) -* -tree-reduce: Tree operations. (line 52) -* -tree-reduce-from: Tree operations. (line 69) +* -tree-mapreduce: Tree operations. (line 85) +* -tree-mapreduce-from: Tree operations. (line 104) +* -tree-reduce: Tree operations. (line 53) +* -tree-reduce-from: Tree operations. (line 70) * -tree-seq: Tree operations. (line 8) * -unfold: Unfolding. (line 25) * -union: Set operations. (line 8) * -unzip: Other list operations. (line 158) -* -update-at: List to list. (line 133) +* -update-at: List to list. (line 135) * -when-let: Binding. (line 9) * -when-let*: Binding. (line 21) * -zip: Other list operations. @@ -4532,203 +4560,203 @@ Node: Functions4877 Node: Maps6361 Ref: -map6658 Ref: -map-when7031 -Ref: -map-first7606 -Ref: -map-last8081 -Ref: -map-indexed8551 -Ref: -annotate9237 -Ref: -splice9724 -Ref: -splice-list10502 -Ref: -mapcat10961 -Ref: -copy11334 -Node: Sublist selection11522 -Ref: -filter11715 -Ref: -remove12262 -Ref: -remove-first12800 -Ref: -remove-last13642 -Ref: -remove-item14367 -Ref: -non-nil14767 -Ref: -slice15043 -Ref: -take15572 -Ref: -take-last15979 -Ref: -drop16410 -Ref: -drop-last16851 -Ref: -take-while17277 -Ref: -drop-while17892 -Ref: -select-by-indices18508 -Ref: -select-columns19019 -Ref: -select-column19722 -Node: List to list20185 -Ref: -keep20377 -Ref: -concat20941 -Ref: -flatten21235 -Ref: -flatten-n21991 -Ref: -replace22375 -Ref: -replace-first22836 -Ref: -replace-last23331 -Ref: -insert-at23819 -Ref: -replace-at24144 -Ref: -update-at24531 -Ref: -remove-at25019 -Ref: -remove-at-indices25504 -Node: Reductions26083 -Ref: -reduce-from26279 -Ref: -reduce-r-from27003 -Ref: -reduce28266 -Ref: -reduce-r29017 -Ref: -reductions-from30295 -Ref: -reductions-r-from31101 -Ref: -reductions31931 -Ref: -reductions-r32642 -Ref: -count33387 -Ref: -sum33611 -Ref: -running-sum33799 -Ref: -product34120 -Ref: -running-product34328 -Ref: -inits34669 -Ref: -tails34914 -Ref: -common-prefix35158 -Ref: -common-suffix35452 -Ref: -min35746 -Ref: -min-by35972 -Ref: -max36493 -Ref: -max-by36718 -Node: Unfolding37244 -Ref: -iterate37485 -Ref: -unfold37932 -Node: Predicates38737 -Ref: -some38914 -Ref: -every39331 -Ref: -any?40010 -Ref: -all?40341 -Ref: -none?41048 -Ref: -only-some?41350 -Ref: -contains?41835 -Ref: -same-items?42224 -Ref: -is-prefix?42609 -Ref: -is-suffix?42935 -Ref: -is-infix?43261 -Ref: -cons-pair?43615 -Node: Partitioning43940 -Ref: -split-at44128 -Ref: -split-with44792 -Ref: -split-on45192 -Ref: -split-when45863 -Ref: -separate46500 -Ref: -partition46939 -Ref: -partition-all47388 -Ref: -partition-in-steps47813 -Ref: -partition-all-in-steps48307 -Ref: -partition-by48789 -Ref: -partition-by-header49167 -Ref: -partition-after-pred49768 -Ref: -partition-before-pred50215 -Ref: -partition-before-item50600 -Ref: -partition-after-item50907 -Ref: -group-by51209 -Node: Indexing51642 -Ref: -elem-index51844 -Ref: -elem-indices52239 -Ref: -find-index52619 -Ref: -find-last-index53108 -Ref: -find-indices53612 -Ref: -grade-up54017 -Ref: -grade-down54424 -Node: Set operations54838 -Ref: -union55021 -Ref: -difference55459 -Ref: -intersection55871 -Ref: -powerset56303 -Ref: -permutations56513 -Ref: -distinct56809 -Node: Other list operations57183 -Ref: -rotate57408 -Ref: -repeat57761 -Ref: -cons*58040 -Ref: -snoc58456 -Ref: -interpose58866 -Ref: -interleave59160 -Ref: -iota59526 -Ref: -zip-with60009 -Ref: -zip60723 -Ref: -zip-lists61552 -Ref: -zip-fill62250 -Ref: -unzip62572 -Ref: -cycle63314 -Ref: -pad63713 -Ref: -table64032 -Ref: -table-flat64818 -Ref: -first65823 -Ref: -last66309 -Ref: -first-item66643 -Ref: -second-item67042 -Ref: -third-item67306 -Ref: -fourth-item67568 -Ref: -fifth-item67834 -Ref: -last-item68096 -Ref: -butlast68387 -Ref: -sort68632 -Ref: -list69118 -Ref: -fix69687 -Node: Tree operations70176 -Ref: -tree-seq70372 -Ref: -tree-map71227 -Ref: -tree-map-nodes71667 -Ref: -tree-reduce72514 -Ref: -tree-reduce-from73396 -Ref: -tree-mapreduce73996 -Ref: -tree-mapreduce-from74855 -Ref: -clone76140 -Node: Threading macros76467 -Ref: ->76692 -Ref: ->>77180 -Ref: -->77683 -Ref: -as->78239 -Ref: -some->78693 -Ref: -some->>79066 -Ref: -some-->79501 -Ref: -doto80050 -Node: Binding80603 -Ref: -when-let80810 -Ref: -when-let*81265 -Ref: -if-let81788 -Ref: -if-let*82148 -Ref: -let82765 -Ref: -let*88837 -Ref: -lambda89774 -Ref: -setq90580 -Node: Side effects91381 -Ref: -each91575 -Ref: -each-while92096 -Ref: -each-indexed92698 -Ref: -each-r93284 -Ref: -each-r-while93720 -Ref: -dotimes94346 -Node: Destructive operations94899 -Ref: !cons95117 -Ref: !cdr95321 -Node: Function combinators95514 -Ref: -partial95718 -Ref: -rpartial96236 -Ref: -juxt96884 -Ref: -compose97336 -Ref: -applify97943 -Ref: -on98373 -Ref: -flip99145 -Ref: -rotate-args99669 -Ref: -const100298 -Ref: -cut100640 -Ref: -not101120 -Ref: -orfn101646 -Ref: -andfn102408 -Ref: -iteratefn103164 -Ref: -fixfn103866 -Ref: -prodfn105422 -Node: Development106480 -Node: Contribute106769 -Node: Contributors107781 -Node: FDL109874 -Node: GPL135194 -Node: Index172943 +Ref: -map-first7605 +Ref: -map-last8200 +Ref: -map-indexed8790 +Ref: -annotate9476 +Ref: -splice9963 +Ref: -splice-list10741 +Ref: -mapcat11200 +Ref: -copy11573 +Node: Sublist selection11761 +Ref: -filter11954 +Ref: -remove12507 +Ref: -remove-first13056 +Ref: -remove-last13904 +Ref: -remove-item14634 +Ref: -non-nil15034 +Ref: -slice15316 +Ref: -take15845 +Ref: -take-last16263 +Ref: -drop16700 +Ref: -drop-last17147 +Ref: -take-while17579 +Ref: -drop-while18206 +Ref: -select-by-indices18839 +Ref: -select-columns19350 +Ref: -select-column20053 +Node: List to list20516 +Ref: -keep20708 +Ref: -concat21284 +Ref: -flatten21767 +Ref: -flatten-n22529 +Ref: -replace22913 +Ref: -replace-first23374 +Ref: -replace-last23869 +Ref: -insert-at24357 +Ref: -replace-at24682 +Ref: -update-at25069 +Ref: -remove-at25610 +Ref: -remove-at-indices26095 +Node: Reductions26674 +Ref: -reduce-from26870 +Ref: -reduce-r-from27594 +Ref: -reduce28857 +Ref: -reduce-r29608 +Ref: -reductions-from30886 +Ref: -reductions-r-from31692 +Ref: -reductions32522 +Ref: -reductions-r33233 +Ref: -count33978 +Ref: -sum34208 +Ref: -running-sum34396 +Ref: -product34717 +Ref: -running-product34925 +Ref: -inits35266 +Ref: -tails35511 +Ref: -common-prefix35755 +Ref: -common-suffix36049 +Ref: -min36343 +Ref: -min-by36569 +Ref: -max37090 +Ref: -max-by37315 +Node: Unfolding37841 +Ref: -iterate38082 +Ref: -unfold38529 +Node: Predicates39334 +Ref: -some39511 +Ref: -every39940 +Ref: -any?40654 +Ref: -all?41003 +Ref: -none?41745 +Ref: -only-some?42065 +Ref: -contains?42610 +Ref: -same-items?43011 +Ref: -is-prefix?43396 +Ref: -is-suffix?43728 +Ref: -is-infix?44060 +Ref: -cons-pair?44420 +Node: Partitioning44751 +Ref: -split-at44939 +Ref: -split-with45603 +Ref: -split-on46243 +Ref: -split-when46914 +Ref: -separate47557 +Ref: -partition48091 +Ref: -partition-all48540 +Ref: -partition-in-steps48965 +Ref: -partition-all-in-steps49511 +Ref: -partition-by50025 +Ref: -partition-by-header50403 +Ref: -partition-after-pred51004 +Ref: -partition-before-pred51457 +Ref: -partition-before-item51842 +Ref: -partition-after-item52149 +Ref: -group-by52451 +Node: Indexing52884 +Ref: -elem-index53086 +Ref: -elem-indices53487 +Ref: -find-index53867 +Ref: -find-last-index54362 +Ref: -find-indices54872 +Ref: -grade-up55277 +Ref: -grade-down55684 +Node: Set operations56098 +Ref: -union56281 +Ref: -difference56695 +Ref: -intersection57113 +Ref: -powerset57526 +Ref: -permutations57736 +Ref: -distinct58032 +Node: Other list operations58412 +Ref: -rotate58637 +Ref: -repeat58990 +Ref: -cons*59275 +Ref: -snoc59697 +Ref: -interpose60109 +Ref: -interleave60403 +Ref: -iota60769 +Ref: -zip-with61252 +Ref: -zip61966 +Ref: -zip-lists62795 +Ref: -zip-fill63493 +Ref: -unzip63815 +Ref: -cycle64557 +Ref: -pad64956 +Ref: -table65275 +Ref: -table-flat66061 +Ref: -first67066 +Ref: -last67564 +Ref: -first-item67910 +Ref: -second-item68315 +Ref: -third-item68585 +Ref: -fourth-item68853 +Ref: -fifth-item69125 +Ref: -last-item69393 +Ref: -butlast69690 +Ref: -sort69935 +Ref: -list70427 +Ref: -fix70996 +Node: Tree operations71485 +Ref: -tree-seq71681 +Ref: -tree-map72542 +Ref: -tree-map-nodes72982 +Ref: -tree-reduce73846 +Ref: -tree-reduce-from74728 +Ref: -tree-mapreduce75328 +Ref: -tree-mapreduce-from76187 +Ref: -clone77472 +Node: Threading macros77799 +Ref: ->78024 +Ref: ->>78512 +Ref: -->79015 +Ref: -as->79571 +Ref: -some->80025 +Ref: -some->>80410 +Ref: -some-->80857 +Ref: -doto81424 +Node: Binding81977 +Ref: -when-let82184 +Ref: -when-let*82645 +Ref: -if-let83174 +Ref: -if-let*83540 +Ref: -let84163 +Ref: -let*90253 +Ref: -lambda91190 +Ref: -setq91996 +Node: Side effects92797 +Ref: -each92991 +Ref: -each-while93518 +Ref: -each-indexed94138 +Ref: -each-r94730 +Ref: -each-r-while95172 +Ref: -dotimes95816 +Node: Destructive operations96369 +Ref: !cons96587 +Ref: !cdr96791 +Node: Function combinators96984 +Ref: -partial97188 +Ref: -rpartial97706 +Ref: -juxt98354 +Ref: -compose98806 +Ref: -applify99413 +Ref: -on99843 +Ref: -flip100615 +Ref: -rotate-args101139 +Ref: -const101768 +Ref: -cut102110 +Ref: -not102590 +Ref: -orfn103134 +Ref: -andfn103927 +Ref: -iteratefn104714 +Ref: -fixfn105416 +Ref: -prodfn106990 +Node: Development108151 +Node: Contribute108440 +Node: Contributors109452 +Node: FDL111545 +Node: GPL136865 +Node: Index174614  End Tag Table diff --git a/elpa/dash-20210826.1149/dir b/elpa/dash-20220417.2250/dir similarity index 100% rename from elpa/dash-20210826.1149/dir rename to elpa/dash-20220417.2250/dir