[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[elpa] externals/dash 937f8a1 026/316: Update documentation
|
From: |
ELPA Syncer |
|
Subject: |
[elpa] externals/dash 937f8a1 026/316: Update documentation |
|
Date: |
Mon, 15 Feb 2021 15:57:18 -0500 (EST) |
branch: externals/dash
commit 937f8a18868cdfa988f3884abae18d21fb0fa6f6
Author: Matus Goljer <matus.goljer@gmail.com>
Commit: Matus Goljer <matus.goljer@gmail.com>
Update documentation
---
README.md | 10 +-
dash.info | 2533 +++++++++++++++++++++++++++++++------------------------------
dash.texi | 207 +++--
3 files changed, 1459 insertions(+), 1291 deletions(-)
diff --git a/README.md b/README.md
index cd8f4b4..7ae077d 100644
--- a/README.md
+++ b/README.md
@@ -1370,7 +1370,7 @@ Operations pretending lists are sets.
#### -union `(list list2)`
-Return a new list containing the elements of `list1` and elements of `list2`
that are not in `list1`.
+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.
@@ -2345,7 +2345,7 @@ See `srfi-26` for detailed description.
#### -not `(pred)`
-Take an unary predicates `pred` and return an unary predicate
+Take a unary predicate `pred` and return a unary predicate
that returns t if `pred` returns nil and nil if `pred` returns
non-nil.
@@ -2356,7 +2356,7 @@ non-nil.
#### -orfn `(&rest preds)`
-Take list of unary predicates `preds` and return an unary
+Take list of unary predicates `preds` and return a unary
predicate with argument x that returns non-nil if at least one of
the `preds` returns non-nil on x.
@@ -2369,7 +2369,7 @@ In types: [a -> Bool] -> a -> Bool
#### -andfn `(&rest preds)`
-Take list of unary predicates `preds` and return an unary
+Take list of unary predicates `preds` and return a unary
predicate with argument x that returns non-nil if all of the
`preds` returns non-nil on x.
@@ -2386,7 +2386,7 @@ In types: [a -> Bool] -> a -> Bool
Return a function `fn` composed `n` times with itself.
`fn` is a unary function. If you need to use a function of higher
-arity, use [`-applify`](#-applify-fn) first to turn it into an unary function.
+arity, use [`-applify`](#-applify-fn) first to turn it into a unary function.
With n = 0, this acts as identity function.
diff --git a/dash.info b/dash.info
index 0512d03..afc83d3 100644
--- a/dash.info
+++ b/dash.info
@@ -1,27 +1,26 @@
-This is dash.info, produced by makeinfo version 4.8 from dash.texi.
+This is dash.info, produced by makeinfo version 5.2 from dash.texi.
-INFO-DIR-SECTION Emacs
-START-INFO-DIR-ENTRY
-* Dash: (dash.info). A modern list library for GNU Emacs
-END-INFO-DIR-ENTRY
+This manual is for ‘dash.el’ version 2.12.1.
- This manual is for `dash.el' version 2.12.0.
-
- Copyright © 2012-2015 Free Software Foundation, Inc.
+ Copyright © 2012-2015 Magnar Sveen
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
- published by the Free Software Foundation, either version 3 of
- the License, or (at your option) any later version.
+ published by the Free Software Foundation, either version 3 of the
+ License, or (at your option) any later version.
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see
- `http://www.gnu.org/licenses/'.
+ <http://www.gnu.org/licenses/>.
+INFO-DIR-SECTION Emacs
+START-INFO-DIR-ENTRY
+* Dash: (dash.info). A modern list library for GNU Emacs
+END-INFO-DIR-ENTRY
File: dash.info, Node: Top, Next: Installation, Up: (dir)
@@ -29,23 +28,23 @@ File: dash.info, Node: Top, Next: Installation, Up: (dir)
dash
****
-This manual is for `dash.el' version 2.12.0.
+This manual is for ‘dash.el’ version 2.12.1.
- Copyright © 2012-2015 Free Software Foundation, Inc.
+ Copyright © 2012-2015 Magnar Sveen
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
- published by the Free Software Foundation, either version 3 of
- the License, or (at your option) any later version.
+ published by the Free Software Foundation, either version 3 of the
+ License, or (at your option) any later version.
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see
- `http://www.gnu.org/licenses/'.
+ <http://www.gnu.org/licenses/>.
* Menu:
@@ -54,7 +53,7 @@ This manual is for `dash.el' version 2.12.0.
* Development::
* Index::
---- The Detailed Node Listing ---
+— The Detailed Node Listing —
Installation
@@ -92,13 +91,13 @@ File: dash.info, Node: Installation, Next: Functions,
Prev: Top, Up: Top
1 Installation
**************
-It's available on marmalade (http://marmalade-repo.org/) and Melpa
-(https://melpa.org/); use `M-x package-install':
+It’s available on marmalade (http://marmalade-repo.org/) and Melpa
+(https://melpa.org/); use ‘M-x package-install’:
-`M-x package-install <RET> dash'
+‘M-x package-install <RET> dash’
Install the dash library.
-`M-x package-install <RET> dash-functional'
+‘M-x package-install <RET> dash-functional’
Optional, if you want the function combinators.
Alternatively, you can just dump dash.el or dash-functional.el in
@@ -117,11 +116,11 @@ File: dash.info, Node: Using in a package, Next: Syntax
highlighting of dash f
Add this to the big comment block at the top:
- ;; Package-Requires: ((dash "2.12.0"))
+ ;; Package-Requires: ((dash "2.12.1"))
To get function combinators:
- ;; Package-Requires: ((dash "2.12.0") (dash-functional "1.2.0") (emacs
"24"))
+ ;; Package-Requires: ((dash "2.12.1") (dash-functional "1.2.0") (emacs
"24"))
File: dash.info, Node: Syntax highlighting of dash functions, Prev: Using in
a package, Up: Installation
@@ -140,17 +139,16 @@ File: dash.info, Node: Functions, Next: Development,
Prev: Installation, Up:
2 Functions
***********
-This chapter contains reference documentation for the dash
-application programming interface (API). All functions and
-constructs in the library are prefixed with a dash (-).
+This chapter contains reference documentation for the dash application
+programming interface (API). All functions and constructs in the library
+are prefixed with a dash (-).
There are also anaphoric versions of functions where that makes
sense, prefixed with two dashes instead of one.
- For instance, while `-map' takes a function to map over the list,
-one can also use the anaphoric form with double dashes - which will
-then be executed with `it' exposed as the list item. Here's an
-example:
+ For instance, while ‘-map’ takes a function to map over the list, one
+can also use the anaphoric form with double dashes - which will then be
+executed with ‘it’ exposed as the list item. Here’s an example:
(-map (lambda (n) (* n n)) '(1 2 3 4)) ;; normal version
@@ -189,20 +187,20 @@ File: dash.info, Node: Maps, Next: Sublist selection,
Up: Functions
2.1 Maps
========
-Functions in this category take a transforming function, which is
-then applied sequentially to each or selected elements of the input
-list. The results are collected in order and returned as new list.
+Functions in this category take a transforming function, which is then
+applied sequentially to each or selected elements of the input list.
+The results are collected in order and returned as new list.
-- Function: -map (fn list)
Return a new list consisting of the result of applying FN to the
items in LIST.
(-map (lambda (num) (* num num)) '(1 2 3 4))
- => '(1 4 9 16)
+ ⇒ '(1 4 9 16)
(-map 'square '(1 2 3 4))
- => '(1 4 9 16)
+ ⇒ '(1 4 9 16)
(--map (* it it) '(1 2 3 4))
- => '(1 4 9 16)
+ ⇒ '(1 4 9 16)
-- Function: -map-when (pred rep list)
Return a new list where the elements in LIST that does not match
@@ -210,119 +208,121 @@ list. The results are collected in order and returned
as new list.
that do match the PRED function are mapped through the REP
function.
- Alias: `-replace-where'
+ Alias: ‘-replace-where’
- See also: `-update-at' (*note -update-at::)
+ See also: ‘-update-at’ (*note -update-at::)
(-map-when 'even? 'square '(1 2 3 4))
- => '(1 4 3 16)
+ ⇒ '(1 4 3 16)
(--map-when (> it 2) (* it it) '(1 2 3 4))
- => '(1 2 9 16)
+ ⇒ '(1 2 9 16)
(--map-when (= it 2) 17 '(1 2 3 4))
- => '(1 17 3 4)
+ ⇒ '(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.
- See also: `-map-when' (*note -map-when::), `-replace-first'
- (*note -replace-first::)
+ See also: ‘-map-when’ (*note -map-when::), ‘-replace-first’ (*note
+ -replace-first::)
(-map-first 'even? 'square '(1 2 3 4))
- => '(1 4 3 4)
+ ⇒ '(1 4 3 4)
(--map-first (> it 2) (* it it) '(1 2 3 4))
- => '(1 2 9 4)
+ ⇒ '(1 2 9 4)
(--map-first (= it 2) 17 '(1 2 3 2))
- => '(1 17 3 2)
+ ⇒ '(1 17 3 2)
-- Function: -map-last (pred rep list)
Replace first item in LIST satisfying PRED with result of REP
called on this item.
- See also: `-map-when' (*note -map-when::), `-replace-last'
- (*note -replace-last::)
+ See also: ‘-map-when’ (*note -map-when::), ‘-replace-last’ (*note
+ -replace-last::)
(-map-last 'even? 'square '(1 2 3 4))
- => '(1 2 3 16)
+ ⇒ '(1 2 3 16)
(--map-last (> it 2) (* it it) '(1 2 3 4))
- => '(1 2 3 16)
+ ⇒ '(1 2 3 16)
(--map-last (= it 2) 17 '(1 2 3 2))
- => '(1 2 3 17)
+ ⇒ '(1 2 3 17)
-- Function: -map-indexed (fn list)
- Return a new list consisting of the result of (FN index item)
- for each item in LIST.
+ Return a new list consisting of the result of (FN index item) for
+ each item in LIST.
+
+ In the anaphoric form ‘--map-indexed’, the index is exposed as
+ ‘it-index‘.
- In the anaphoric form `--map-indexed', the index is exposed as
- `it-index`.
+ See also: ‘-each-indexed’ (*note -each-indexed::).
(-map-indexed (lambda (index item) (- item index)) '(1 2 3 4))
- => '(1 1 1 1)
+ ⇒ '(1 1 1 1)
(--map-indexed (- it it-index) '(1 2 3 4))
- => '(1 1 1 1)
+ ⇒ '(1 1 1 1)
-- Function: -annotate (fn list)
Return a list of cons cells where each cell is FN applied to each
element of LIST paired with the unmodified element of LIST.
(-annotate '1+ '(1 2 3))
- => '((2 . 1) (3 . 2) (4 . 3))
+ ⇒ '((2 . 1) (3 . 2) (4 . 3))
(-annotate 'length '(("h" "e" "l" "l" "o") ("hello" "world")))
- => '((5 "h" "e" "l" "l" "o") (2 "hello" "world"))
+ ⇒ '((5 "h" "e" "l" "l" "o") (2 "hello" "world"))
(--annotate (< 1 it) '(0 1 2 3))
- => '((nil . 0) (nil . 1) (t . 2) (t . 3))
+ ⇒ '((nil . 0) (nil . 1) (t . 2) (t . 3))
-- Function: -splice (pred fun list)
- Splice lists generated by FUN in place of elements matching PRED
- in LIST.
+ Splice lists generated by FUN in place of elements matching PRED in
+ LIST.
FUN takes the element matching PRED as input.
- This function can be used as replacement for `,@' in case you
- need to splice several lists at marked positions (for example
- with keywords).
+ This function can be used as replacement for ‘,@’ in case you need
+ to splice several lists at marked positions (for example with
+ keywords).
- See also: `-splice-list' (*note -splice-list::), `-insert-at'
+ See also: ‘-splice-list’ (*note -splice-list::), ‘-insert-at’
(*note -insert-at::)
(-splice 'even? (lambda (x) (list x x)) '(1 2 3 4))
- => '(1 2 2 3 4 4)
+ ⇒ '(1 2 2 3 4 4)
(--splice 't (list it it) '(1 2 3 4))
- => '(1 1 2 2 3 3 4 4)
+ ⇒ '(1 1 2 2 3 3 4 4)
(--splice (equal it :magic) '((list of) (magical) (code)) '((foo)
(bar) :magic (baz)))
- => '((foo) (bar) (list of) (magical) (code) (baz))
+ ⇒ '((foo) (bar) (list of) (magical) (code) (baz))
-- Function: -splice-list (pred new-list list)
Splice NEW-LIST in place of elements matching PRED in LIST.
- See also: `-splice' (*note -splice::), `-insert-at' (*note
+ See also: ‘-splice’ (*note -splice::), ‘-insert-at’ (*note
-insert-at::)
(-splice-list 'keywordp '(a b c) '(1 :foo 2))
- => '(1 a b c 2)
+ ⇒ '(1 a b c 2)
(-splice-list 'keywordp nil '(1 :foo 2))
- => '(1 2)
+ ⇒ '(1 2)
(--splice-list (keywordp it) '(a b c) '(1 :foo 2))
- => '(1 a b c 2)
+ ⇒ '(1 a b c 2)
-- Function: -mapcat (fn list)
Return the concatenation of the result of mapping FN over LIST.
Thus function FN should return a list.
(-mapcat 'list '(1 2 3))
- => '(1 2 3)
+ ⇒ '(1 2 3)
(-mapcat (lambda (item) (list 0 item)) '(1 2 3))
- => '(0 1 0 2 0 3)
+ ⇒ '(0 1 0 2 0 3)
(--mapcat (list 0 it) '(1 2 3))
- => '(0 1 0 2 0 3)
+ ⇒ '(0 1 0 2 0 3)
-- Function: -copy (arg)
Create a shallow copy of LIST.
(-copy '(1 2 3))
- => '(1 2 3)
+ ⇒ '(1 2 3)
(let ((a '(1 2 3))) (eq a (-copy a)))
- => nil
+ ⇒ nil
File: dash.info, Node: Sublist selection, Next: List to list, Prev: Maps,
Up: Functions
@@ -336,75 +336,76 @@ Functions returning a sublist of the original list.
Return a new list of the items in LIST for which PRED returns a
non-nil value.
- Alias: `-select'
+ Alias: ‘-select’
+
+ See also: ‘-keep’ (*note -keep::)
(-filter (lambda (num) (= 0 (% num 2))) '(1 2 3 4))
- => '(2 4)
+ ⇒ '(2 4)
(-filter 'even? '(1 2 3 4))
- => '(2 4)
+ ⇒ '(2 4)
(--filter (= 0 (% it 2)) '(1 2 3 4))
- => '(2 4)
+ ⇒ '(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'
+ Alias: ‘-reject’
(-remove (lambda (num) (= 0 (% num 2))) '(1 2 3 4))
- => '(1 3)
+ ⇒ '(1 3)
(-remove 'even? '(1 2 3 4))
- => '(1 3)
+ ⇒ '(1 3)
(--remove (= 0 (% it 2)) '(1 2 3 4))
- => '(1 3)
+ ⇒ '(1 3)
-- Function: -remove-first (pred list)
Return a new list with the first item matching PRED removed.
- Alias: `-reject-first'
+ Alias: ‘-reject-first’
- See also: `-remove' (*note -remove::), `-map-first' (*note
+ See also: ‘-remove’ (*note -remove::), ‘-map-first’ (*note
-map-first::)
(-remove-first 'even? '(1 3 5 4 7 8 10))
- => '(1 3 5 7 8 10)
+ ⇒ '(1 3 5 7 8 10)
(-remove-first 'stringp '(1 2 "first" "second" "third"))
- => '(1 2 "second" "third")
+ ⇒ '(1 2 "second" "third")
(--remove-first (> it 3) '(1 2 3 4 5 6 7 8 9 10))
- => '(1 2 3 5 6 7 8 9 10)
+ ⇒ '(1 2 3 5 6 7 8 9 10)
-- Function: -remove-last (pred list)
Return a new list with the last item matching PRED removed.
- Alias: `-reject-last'
+ Alias: ‘-reject-last’
- See also: `-remove' (*note -remove::), `-map-last' (*note
+ See also: ‘-remove’ (*note -remove::), ‘-map-last’ (*note
-map-last::)
(-remove-last 'even? '(1 3 5 4 7 8 10 11))
- => '(1 3 5 4 7 8 11)
+ ⇒ '(1 3 5 4 7 8 11)
(-remove-last 'stringp '(1 2 "last" "second" "third"))
- => '(1 2 "last" "second")
+ ⇒ '(1 2 "last" "second")
(--remove-last (> it 3) '(1 2 3 4 5 6 7 8 9 10))
- => '(1 2 3 4 5 6 7 8 9)
+ ⇒ '(1 2 3 4 5 6 7 8 9)
-- Function: -remove-item (item list)
Remove all occurences of ITEM from LIST.
- Comparison is done with `equal'.
+ Comparison is done with ‘equal’.
(-remove-item 3 '(1 2 3 2 3 4 5 3))
- => '(1 2 2 4 5)
+ ⇒ '(1 2 2 4 5)
(-remove-item 'foo '(foo bar baz foo))
- => '(bar baz)
+ ⇒ '(bar baz)
(-remove-item "bob" '("alice" "bob" "eve" "bob" "dave"))
- => '("alice" "eve" "dave")
+ ⇒ '("alice" "eve" "dave")
-- Function: -non-nil (list)
Return all non-nil elements of LIST.
(-non-nil '(1 nil 2 nil nil 3 4 nil 5 nil))
- => '(1 2 3 4 5)
+ ⇒ '(1 2 3 4 5)
-- Function: -slice (list from &optional to step)
Return copy of LIST, starting from index FROM to index TO.
@@ -412,65 +413,124 @@ Functions returning a sublist of the original list.
FROM or TO may be negative. These values are then interpreted
modulo the length of the list.
- If STEP is a number, only each STEPth item in the resulting
- section is returned. Defaults to 1.
+ If STEP is a number, only each STEPth item in the resulting section
+ is returned. Defaults to 1.
(-slice '(1 2 3 4 5) 1)
- => '(2 3 4 5)
+ ⇒ '(2 3 4 5)
(-slice '(1 2 3 4 5) 0 3)
- => '(1 2 3)
+ ⇒ '(1 2 3)
(-slice '(1 2 3 4 5 6 7 8 9) 1 -1 2)
- => '(2 4 6 8)
+ ⇒ '(2 4 6 8)
-- Function: -take (n list)
Return a new list of the first N items in LIST, or all items if
there are fewer than N.
+ See also: ‘-take-last’ (*note -take-last::)
+
(-take 3 '(1 2 3 4 5))
- => '(1 2 3)
+ ⇒ '(1 2 3)
(-take 17 '(1 2 3 4 5))
- => '(1 2 3 4 5)
+ ⇒ '(1 2 3 4 5)
+
+ -- Function: -take-last (n list)
+ Return the last N items of LIST in order.
+
+ See also: ‘-take’ (*note -take::)
+
+ (-take-last 3 '(1 2 3 4 5))
+ ⇒ '(3 4 5)
+ (-take-last 17 '(1 2 3 4 5))
+ ⇒ '(1 2 3 4 5)
+ (-take-last 1 '(1 2 3 4 5))
+ ⇒ '(5)
-- Function: -drop (n list)
Return the tail of LIST without the first N items.
+ See also: ‘-drop-last’ (*note -drop-last::)
+
(-drop 3 '(1 2 3 4 5))
- => '(4 5)
+ ⇒ '(4 5)
(-drop 17 '(1 2 3 4 5))
- => '()
+ ⇒ '()
+
+ -- Function: -drop-last (n list)
+ Remove the last N items of LIST and return a copy.
+
+ See also: ‘-drop’ (*note -drop::)
+
+ (-drop-last 3 '(1 2 3 4 5))
+ ⇒ '(1 2)
+ (-drop-last 17 '(1 2 3 4 5))
+ ⇒ '()
-- Function: -take-while (pred list)
- Return a new list of successive items from LIST while (PRED
- item) returns a non-nil value.
+ Return a new list of successive items from LIST while (PRED item)
+ returns a non-nil value.
(-take-while 'even? '(1 2 3 4))
- => '()
+ ⇒ '()
(-take-while 'even? '(2 4 5 6))
- => '(2 4)
+ ⇒ '(2 4)
(--take-while (< it 4) '(1 2 3 4 3 2 1))
- => '(1 2 3)
+ ⇒ '(1 2 3)
-- Function: -drop-while (pred list)
Return the tail of LIST starting from the first item for which
(PRED item) returns nil.
(-drop-while 'even? '(1 2 3 4))
- => '(1 2 3 4)
+ ⇒ '(1 2 3 4)
(-drop-while 'even? '(2 4 5 6))
- => '(5 6)
+ ⇒ '(5 6)
(--drop-while (< it 4) '(1 2 3 4 3 2 1))
- => '(4 3 2 1)
+ ⇒ '(4 3 2 1)
-- Function: -select-by-indices (indices list)
Return a list whose elements are elements from LIST selected as
- `(nth i list)` for all i from INDICES.
+ ‘(nth i list)‘ for all i from INDICES.
(-select-by-indices '(4 10 2 3 6) '("v" "e" "l" "o" "c" "i" "r" "a"
"p" "t" "o" "r"))
- => '("c" "o" "l" "o" "r")
+ ⇒ '("c" "o" "l" "o" "r")
(-select-by-indices '(2 1 0) '("a" "b" "c"))
- => '("c" "b" "a")
+ ⇒ '("c" "b" "a")
(-select-by-indices '(0 1 2 0 1 3 3 1) '("f" "a" "r" "l"))
- => '("f" "a" "r" "f" "a" "l" "l" "a")
+ ⇒ '("f" "a" "r" "f" "a" "l" "l" "a")
+
+ -- Function: -select-columns (columns table)
+ Select COLUMNS from TABLE.
+
+ TABLE is a list of lists where each element represents one row. It
+ is assumed each row has the same length.
+
+ Each row is transformed such that only the specified COLUMNS are
+ selected.
+
+ See also: ‘-select-column’ (*note -select-column::),
+ ‘-select-by-indices’ (*note -select-by-indices::)
+
+ (-select-columns '(0 2) '((1 2 3) (a b c) (:a :b :c)))
+ ⇒ '((1 3) (a c) (:a :c))
+ (-select-columns '(1) '((1 2 3) (a b c) (:a :b :c)))
+ ⇒ '((2) (b) (:b))
+ (-select-columns nil '((1 2 3) (a b c) (:a :b :c)))
+ ⇒ '(nil nil nil)
+
+ -- Function: -select-column (column table)
+ Select COLUMN from TABLE.
+
+ TABLE is a list of lists where each element represents one row. It
+ is assumed each row has the same length.
+
+ The single selected column is returned as a list.
+
+ See also: ‘-select-columns’ (*note -select-columns::),
+ ‘-select-by-indices’ (*note -select-by-indices::)
+
+ (-select-column 1 '((1 2 3) (a b c) (:a :b :c)))
+ ⇒ '(2 b :b)
File: dash.info, Node: List to list, Next: Reductions, Prev: Sublist
selection, Up: Functions
@@ -484,166 +544,165 @@ Bag of various functions which modify input list.
Return a new list of the non-nil results of applying FN to the
items in LIST.
- If you want to select the original items satisfying a predicate
- use `-filter' (*note -filter::).
+ If you want to select the original items satisfying a predicate use
+ ‘-filter’ (*note -filter::).
(-keep 'cdr '((1 2 3) (4 5) (6)))
- => '((2 3) (5))
+ ⇒ '((2 3) (5))
(-keep (lambda (num) (when (> num 3) (* 10 num))) '(1 2 3 4 5 6))
- => '(40 50 60)
+ ⇒ '(40 50 60)
(--keep (when (> it 3) (* 10 it)) '(1 2 3 4 5 6))
- => '(40 50 60)
+ ⇒ '(40 50 60)
-- Function: -concat (&rest lists)
Return a new list with the concatenation of the elements in the
supplied LISTS.
(-concat '(1))
- => '(1)
+ ⇒ '(1)
(-concat '(1) '(2))
- => '(1 2)
+ ⇒ '(1 2)
(-concat '(1) '(2 3) '(4))
- => '(1 2 3 4)
+ ⇒ '(1 2 3 4)
-- Function: -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'
- (*note -flatten-n::) or map them to some unique symbol and then
- map them back.
+ 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.
Conses of two atoms are considered "terminals", that is, they
- aren't flattened further.
+ aren’t flattened further.
- See also: `-flatten-n' (*note -flatten-n::)
+ See also: ‘-flatten-n’ (*note -flatten-n::)
(-flatten '((1)))
- => '(1)
+ ⇒ '(1)
(-flatten '((1 (2 3) (((4 (5)))))))
- => '(1 2 3 4 5)
+ ⇒ '(1 2 3 4 5)
(-flatten '(1 2 (3 . 4)))
- => '(1 2 (3 . 4))
+ ⇒ '(1 2 (3 . 4))
-- Function: -flatten-n (num list)
Flatten NUM levels of a nested LIST.
- See also: `-flatten' (*note -flatten::)
+ See also: ‘-flatten’ (*note -flatten::)
(-flatten-n 1 '((1 2) ((3 4) ((5 6)))))
- => '(1 2 (3 4) ((5 6)))
+ ⇒ '(1 2 (3 4) ((5 6)))
(-flatten-n 2 '((1 2) ((3 4) ((5 6)))))
- => '(1 2 3 4 (5 6))
+ ⇒ '(1 2 3 4 (5 6))
(-flatten-n 3 '((1 2) ((3 4) ((5 6)))))
- => '(1 2 3 4 5 6)
+ ⇒ '(1 2 3 4 5 6)
-- Function: -replace (old new list)
Replace all OLD items in LIST with NEW.
- Elements are compared using `equal'.
+ Elements are compared using ‘equal’.
- See also: `-replace-at' (*note -replace-at::)
+ See also: ‘-replace-at’ (*note -replace-at::)
(-replace 1 "1" '(1 2 3 4 3 2 1))
- => '("1" 2 3 4 3 2 "1")
+ ⇒ '("1" 2 3 4 3 2 "1")
(-replace "foo" "bar" '("a" "nice" "foo" "sentence" "about" "foo"))
- => '("a" "nice" "bar" "sentence" "about" "bar")
+ ⇒ '("a" "nice" "bar" "sentence" "about" "bar")
(-replace 1 2 nil)
- => nil
+ ⇒ nil
-- Function: -replace-first (old new list)
Replace the first occurence of OLD with NEW in LIST.
- Elements are compared using `equal'.
+ Elements are compared using ‘equal’.
- See also: `-map-first' (*note -map-first::)
+ See also: ‘-map-first’ (*note -map-first::)
(-replace-first 1 "1" '(1 2 3 4 3 2 1))
- => '("1" 2 3 4 3 2 1)
+ ⇒ '("1" 2 3 4 3 2 1)
(-replace-first "foo" "bar" '("a" "nice" "foo" "sentence" "about"
"foo"))
- => '("a" "nice" "bar" "sentence" "about" "foo")
+ ⇒ '("a" "nice" "bar" "sentence" "about" "foo")
(-replace-first 1 2 nil)
- => nil
+ ⇒ nil
-- Function: -replace-last (old new list)
Replace the last occurence of OLD with NEW in LIST.
- Elements are compared using `equal'.
+ Elements are compared using ‘equal’.
- See also: `-map-last' (*note -map-last::)
+ See also: ‘-map-last’ (*note -map-last::)
(-replace-last 1 "1" '(1 2 3 4 3 2 1))
- => '(1 2 3 4 3 2 "1")
+ ⇒ '(1 2 3 4 3 2 "1")
(-replace-last "foo" "bar" '("a" "nice" "foo" "sentence" "about"
"foo"))
- => '("a" "nice" "foo" "sentence" "about" "bar")
+ ⇒ '("a" "nice" "foo" "sentence" "about" "bar")
(-replace-last 1 2 nil)
- => nil
+ ⇒ nil
-- Function: -insert-at (n x list)
Return a list with X inserted into LIST at position N.
- See also: `-splice' (*note -splice::), `-splice-list' (*note
+ See also: ‘-splice’ (*note -splice::), ‘-splice-list’ (*note
-splice-list::)
(-insert-at 1 'x '(a b c))
- => '(a x b c)
+ ⇒ '(a x b c)
(-insert-at 12 'x '(a b c))
- => '(a b c x)
+ ⇒ '(a b c x)
-- Function: -replace-at (n x list)
- Return a list with element at Nth position in LIST replaced with
- X.
+ Return a list with element at Nth position in LIST replaced with X.
- See also: `-replace' (*note -replace::)
+ See also: ‘-replace’ (*note -replace::)
(-replace-at 0 9 '(0 1 2 3 4 5))
- => '(9 1 2 3 4 5)
+ ⇒ '(9 1 2 3 4 5)
(-replace-at 1 9 '(0 1 2 3 4 5))
- => '(0 9 2 3 4 5)
+ ⇒ '(0 9 2 3 4 5)
(-replace-at 4 9 '(0 1 2 3 4 5))
- => '(0 1 2 3 9 5)
+ ⇒ '(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))`.
+ ‘(func (nth n list))‘.
- See also: `-map-when' (*note -map-when::)
+ See also: ‘-map-when’ (*note -map-when::)
(-update-at 0 (lambda (x) (+ x 9)) '(0 1 2 3 4 5))
- => '(9 1 2 3 4 5)
+ ⇒ '(9 1 2 3 4 5)
(-update-at 1 (lambda (x) (+ x 8)) '(0 1 2 3 4 5))
- => '(0 9 2 3 4 5)
+ ⇒ '(0 9 2 3 4 5)
(--update-at 2 (length it) '("foo" "bar" "baz" "quux"))
- => '("foo" "bar" 3 "quux")
+ ⇒ '("foo" "bar" 3 "quux")
-- Function: -remove-at (n list)
Return a list with element at Nth position in LIST removed.
- See also: `-remove-at-indices' (*note -remove-at-indices::),
- `-remove' (*note -remove::)
+ See also: ‘-remove-at-indices’ (*note -remove-at-indices::),
+ ‘-remove’ (*note -remove::)
(-remove-at 0 '("0" "1" "2" "3" "4" "5"))
- => '("1" "2" "3" "4" "5")
+ ⇒ '("1" "2" "3" "4" "5")
(-remove-at 1 '("0" "1" "2" "3" "4" "5"))
- => '("0" "2" "3" "4" "5")
+ ⇒ '("0" "2" "3" "4" "5")
(-remove-at 2 '("0" "1" "2" "3" "4" "5"))
- => '("0" "1" "3" "4" "5")
+ ⇒ '("0" "1" "3" "4" "5")
-- Function: -remove-at-indices (indices list)
Return a list whose elements are elements from LIST without
- elements selected as `(nth i list)` for all i from INDICES.
+ elements selected as ‘(nth i list)‘ for all i from INDICES.
- See also: `-remove-at' (*note -remove-at::), `-remove' (*note
+ See also: ‘-remove-at’ (*note -remove-at::), ‘-remove’ (*note
-remove::)
(-remove-at-indices '(0) '("0" "1" "2" "3" "4" "5"))
- => '("1" "2" "3" "4" "5")
+ ⇒ '("1" "2" "3" "4" "5")
(-remove-at-indices '(0 2 4) '("0" "1" "2" "3" "4" "5"))
- => '("1" "3" "5")
+ ⇒ '("1" "3" "5")
(-remove-at-indices '(0 5) '("0" "1" "2" "3" "4" "5"))
- => '("1" "2" "3" "4")
+ ⇒ '("1" "2" "3" "4")
File: dash.info, Node: Reductions, Next: Unfolding, Prev: List to list,
Up: Functions
@@ -656,160 +715,159 @@ Functions reducing lists into single value.
-- Function: -reduce-from (fn initial-value list)
Return the result of applying FN to INITIAL-VALUE and the first
item in LIST, then applying FN to that result and the 2nd item,
- etc. If LIST contains no items, return INITIAL-VALUE and FN is
- not called.
+ etc. If LIST contains no items, return INITIAL-VALUE and FN is not
+ called.
- In the anaphoric form `--reduce-from', the accumulated value is
- exposed as `acc`.
+ In the anaphoric form ‘--reduce-from’, the accumulated value is
+ exposed as ‘acc‘.
- See also: `-reduce' (*note -reduce::), `-reduce-r' (*note
+ See also: ‘-reduce’ (*note -reduce::), ‘-reduce-r’ (*note
-reduce-r::)
(-reduce-from '- 10 '(1 2 3))
- => 4
+ ⇒ 4
(-reduce-from (lambda (memo item) (concat "(" memo " - "
(int-to-string item) ")")) "10" '(1 2 3))
- => "(((10 - 1) - 2) - 3)"
+ ⇒ "(((10 - 1) - 2) - 3)"
(--reduce-from (concat acc " " it) "START" '("a" "b" "c"))
- => "START a b c"
+ ⇒ "START a b c"
-- Function: -reduce-r-from (fn initial-value list)
Replace conses with FN, nil with INITIAL-VALUE and evaluate the
- resulting expression. If LIST is empty, INITIAL-VALUE is
- returned and FN is not called.
+ resulting expression. If LIST is empty, INITIAL-VALUE is returned
+ and FN is not called.
- Note: this function works the same as `-reduce-from' (*note
- -reduce-from::) but the operation associates from right instead
- of from left.
+ Note: this function works the same as ‘-reduce-from’ (*note
+ -reduce-from::) but the operation associates from right instead of
+ from left.
- See also: `-reduce-r' (*note -reduce-r::), `-reduce' (*note
+ See also: ‘-reduce-r’ (*note -reduce-r::), ‘-reduce’ (*note
-reduce::)
(-reduce-r-from '- 10 '(1 2 3))
- => -8
+ ⇒ -8
(-reduce-r-from (lambda (item memo) (concat "(" (int-to-string item)
" - " memo ")")) "10" '(1 2 3))
- => "(1 - (2 - (3 - 10)))"
+ ⇒ "(1 - (2 - (3 - 10)))"
(--reduce-r-from (concat it " " acc) "END" '("a" "b" "c"))
- => "a b c END"
+ ⇒ "a b c END"
-- Function: -reduce (fn list)
- Return the result of applying FN to the first 2 items in LIST,
- then applying FN to that result and the 3rd item, etc. If LIST
- contains no items, FN must accept no arguments as well, and
- reduce return the result of calling FN with no arguments. If
- LIST has only 1 item, it is returned and FN is not called.
+ Return the result of applying FN to the first 2 items in LIST, then
+ applying FN to that result and the 3rd item, etc. If LIST contains
+ no items, FN must accept no arguments as well, and reduce return
+ the result of calling FN with no arguments. If LIST has only 1
+ item, it is returned and FN is not called.
- In the anaphoric form `--reduce', the accumulated value is
- exposed as `acc`.
+ In the anaphoric form ‘--reduce’, the accumulated value is exposed
+ as ‘acc‘.
- See also: `-reduce-from' (*note -reduce-from::), `-reduce-r'
- (*note -reduce-r::)
+ See also: ‘-reduce-from’ (*note -reduce-from::), ‘-reduce-r’ (*note
+ -reduce-r::)
(-reduce '- '(1 2 3 4))
- => -8
+ ⇒ -8
(-reduce (lambda (memo item) (format "%s-%s" memo item)) '(1 2 3))
- => "1-2-3"
+ ⇒ "1-2-3"
(--reduce (format "%s-%s" acc it) '(1 2 3))
- => "1-2-3"
+ ⇒ "1-2-3"
-- Function: -reduce-r (fn list)
- Replace conses with FN and evaluate the resulting expression.
- The final nil is ignored. If LIST contains no items, FN must
- accept no arguments as well, and reduce return the result of
- calling FN with no arguments. If LIST has only 1 item, it is
- returned and FN is not called.
+ Replace conses with FN and evaluate the resulting expression. The
+ final nil is ignored. If LIST contains no items, FN must accept no
+ arguments as well, and reduce return the result of calling FN with
+ no arguments. If LIST has only 1 item, it is returned and FN is
+ not called.
The first argument of FN is the new item, the second is the
accumulated value.
- Note: this function works the same as `-reduce' (*note
- -reduce::) but the operation associates from right instead of
- from left.
+ Note: this function works the same as ‘-reduce’ (*note -reduce::)
+ but the operation associates from right instead of from left.
- See also: `-reduce-r-from' (*note -reduce-r-from::), `-reduce'
+ See also: ‘-reduce-r-from’ (*note -reduce-r-from::), ‘-reduce’
(*note -reduce::)
(-reduce-r '- '(1 2 3 4))
- => -2
+ ⇒ -2
(-reduce-r (lambda (item memo) (format "%s-%s" memo item)) '(1 2 3))
- => "3-2-1"
+ ⇒ "3-2-1"
(--reduce-r (format "%s-%s" acc it) '(1 2 3))
- => "3-2-1"
+ ⇒ "3-2-1"
-- Function: -count (pred list)
Counts the number of items in LIST where (PRED item) is non-nil.
(-count 'even? '(1 2 3 4 5))
- => 2
+ ⇒ 2
(--count (< it 4) '(1 2 3 4))
- => 3
+ ⇒ 3
-- Function: -sum (list)
Return the sum of LIST.
(-sum '())
- => 0
+ ⇒ 0
(-sum '(1))
- => 1
+ ⇒ 1
(-sum '(1 2 3 4))
- => 10
+ ⇒ 10
-- Function: -product (list)
Return the product of LIST.
(-product '())
- => 1
+ ⇒ 1
(-product '(1))
- => 1
+ ⇒ 1
(-product '(1 2 3 4))
- => 24
+ ⇒ 24
-- Function: -min (list)
Return the smallest value from LIST of numbers or markers.
(-min '(0))
- => 0
+ ⇒ 0
(-min '(3 2 1))
- => 1
+ ⇒ 1
(-min '(1 2 3))
- => 1
+ ⇒ 1
-- Function: -min-by (comparator list)
Take a comparison function COMPARATOR and a LIST and return the
least element of the list by the comparison function.
- See also combinator `-on' (*note -on::) which can transform the
+ See also combinator ‘-on’ (*note -on::) which can transform the
values before comparing them.
(-min-by '> '(4 3 6 1))
- => 1
+ ⇒ 1
(--min-by (> (car it) (car other)) '((1 2 3) (2) (3 2)))
- => '(1 2 3)
+ ⇒ '(1 2 3)
(--min-by (> (length it) (length other)) '((1 2 3) (2) (3 2)))
- => '(2)
+ ⇒ '(2)
-- Function: -max (list)
Return the largest value from LIST of numbers or markers.
(-max '(0))
- => 0
+ ⇒ 0
(-max '(3 2 1))
- => 3
+ ⇒ 3
(-max '(1 2 3))
- => 3
+ ⇒ 3
-- Function: -max-by (comparator list)
Take a comparison function COMPARATOR and a LIST and return the
greatest element of the list by the comparison function.
- See also combinator `-on' (*note -on::) which can transform the
+ See also combinator ‘-on’ (*note -on::) which can transform the
values before comparing them.
(-max-by '> '(4 3 6 1))
- => 6
+ ⇒ 6
(--max-by (> (car it) (car other)) '((1 2 3) (2) (3 2)))
- => '(3 2)
+ ⇒ '(3 2)
(--max-by (> (length it) (length other)) '((1 2 3) (2) (3 2)))
- => '(1 2 3)
+ ⇒ '(1 2 3)
File: dash.info, Node: Unfolding, Next: Predicates, Prev: Reductions, Up:
Functions
@@ -830,30 +888,30 @@ than consuming a list to produce a single value.
N is the length of the returned list.
(-iterate '1+ 1 10)
- => '(1 2 3 4 5 6 7 8 9 10)
+ ⇒ '(1 2 3 4 5 6 7 8 9 10)
(-iterate (lambda (x) (+ x x)) 2 5)
- => '(2 4 8 16 32)
+ ⇒ '(2 4 8 16 32)
(--iterate (* it it) 2 5)
- => '(2 4 16 256 65536)
+ ⇒ '(2 4 16 256 65536)
-- Function: -unfold (fun seed)
Build a list from SEED using FUN.
- This is "dual" operation to `-reduce-r' (*note -reduce-r::):
- while -reduce-r consumes a list to produce a single value,
- `-unfold' (*note -unfold::) takes a seed value and builds a
- (potentially infinite!) list.
+ This is "dual" operation to ‘-reduce-r’ (*note -reduce-r::): while
+ -reduce-r consumes a list to produce a single value, ‘-unfold’
+ (*note -unfold::) takes a seed value and builds a (potentially
+ infinite!) list.
- 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.
+ 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.
(-unfold (lambda (x) (unless (= x 0) (cons x (1- x)))) 10)
- => '(10 9 8 7 6 5 4 3 2 1)
+ ⇒ '(10 9 8 7 6 5 4 3 2 1)
(--unfold (when it (cons it (cdr it))) '(1 2 3 4))
- => '((1 2 3 4) (2 3 4) (3 4) (4))
+ ⇒ '((1 2 3 4) (2 3 4) (3 4) (4))
(--unfold (when it (cons it (butlast it))) '(1 2 3 4))
- => '((1 2 3 4) (1 2 3) (1 2) (1))
+ ⇒ '((1 2 3 4) (1 2 3) (1 2) (1))
File: dash.info, Node: Predicates, Next: Partitioning, Prev: Unfolding,
Up: Functions
@@ -864,120 +922,120 @@ File: dash.info, Node: Predicates, Next:
Partitioning, Prev: Unfolding, Up:
-- Function: -any? (pred list)
Return t if (PRED x) is non-nil for any x in LIST, else nil.
- Alias: `-any-p', `-some?', `-some-p'
+ Alias: ‘-any-p’, ‘-some?’, ‘-some-p’
(-any? 'even? '(1 2 3))
- => t
+ ⇒ t
(-any? 'even? '(1 3 5))
- => nil
+ ⇒ nil
(--any? (= 0 (% it 2)) '(1 2 3))
- => t
+ ⇒ t
-- Function: -all? (pred list)
Return t if (PRED x) is non-nil for all x in LIST, else nil.
- Alias: `-all-p', `-every?', `-every-p'
+ Alias: ‘-all-p’, ‘-every?’, ‘-every-p’
(-all? 'even? '(1 2 3))
- => nil
+ ⇒ nil
(-all? 'even? '(2 4 6))
- => t
+ ⇒ t
(--all? (= 0 (% it 2)) '(2 4 6))
- => t
+ ⇒ t
-- Function: -none? (pred list)
Return t if (PRED x) is nil for all x in LIST, else nil.
- Alias: `-none-p'
+ Alias: ‘-none-p’
(-none? 'even? '(1 2 3))
- => nil
+ ⇒ nil
(-none? 'even? '(1 3 5))
- => t
+ ⇒ t
(--none? (= 0 (% it 2)) '(1 2 3))
- => nil
+ ⇒ 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 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.
- Alias: `-only-some-p'
+ Alias: ‘-only-some-p’
(-only-some? 'even? '(1 2 3))
- => t
+ ⇒ t
(-only-some? 'even? '(1 3 5))
- => nil
+ ⇒ nil
(-only-some? 'even? '(2 4 6))
- => nil
+ ⇒ nil
-- Function: -contains? (list 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.
+ The test for equality is done with ‘equal’, or with ‘-compare-fn’
+ if that’s non-nil.
- Alias: `-contains-p'
+ Alias: ‘-contains-p’
(-contains? '(1 2 3) 1)
- => t
+ ⇒ t
(-contains? '(1 2 3) 2)
- => t
+ ⇒ t
(-contains? '(1 2 3) 4)
- => nil
+ ⇒ nil
-- Function: -same-items? (list list2)
Return true if LIST and LIST2 has the same items.
The order of the elements in the lists does not matter.
- Alias: `-same-items-p'
+ Alias: ‘-same-items-p’
(-same-items? '(1 2 3) '(1 2 3))
- => t
+ ⇒ t
(-same-items? '(1 2 3) '(3 2 1))
- => t
+ ⇒ t
(-same-items? '(1 2 3) '(1 2 3 4))
- => nil
+ ⇒ nil
-- Function: -is-prefix? (prefix list)
Return non-nil if PREFIX is prefix of LIST.
- Alias: `-is-prefix-p'
+ Alias: ‘-is-prefix-p’
(-is-prefix? '(1 2 3) '(1 2 3 4 5))
- => t
+ ⇒ t
(-is-prefix? '(1 2 3 4 5) '(1 2 3))
- => nil
+ ⇒ nil
(-is-prefix? '(1 3) '(1 2 3 4 5))
- => nil
+ ⇒ nil
-- Function: -is-suffix? (suffix list)
Return non-nil if SUFFIX is suffix of LIST.
- Alias: `-is-suffix-p'
+ Alias: ‘-is-suffix-p’
(-is-suffix? '(3 4 5) '(1 2 3 4 5))
- => t
+ ⇒ t
(-is-suffix? '(1 2 3 4 5) '(3 4 5))
- => nil
+ ⇒ nil
(-is-suffix? '(3 5) '(1 2 3 4 5))
- => nil
+ ⇒ nil
-- Function: -is-infix? (infix list)
Return non-nil if INFIX is infix of LIST.
This operation runs in O(n^2) time
- Alias: `-is-infix-p'
+ Alias: ‘-is-infix-p’
(-is-infix? '(1 2 3) '(1 2 3 4 5))
- => t
+ ⇒ t
(-is-infix? '(2 3 4) '(1 2 3 4 5))
- => t
+ ⇒ t
(-is-infix? '(3 4 5) '(1 2 3 4 5))
- => t
+ ⇒ t
File: dash.info, Node: Partitioning, Next: Indexing, Prev: Predicates, Up:
Functions
@@ -988,70 +1046,70 @@ File: dash.info, Node: Partitioning, Next: Indexing,
Prev: Predicates, Up: F
Functions partitioning the input list into a list of lists.
-- Function: -split-at (n list)
- Return a list of ((-take N LIST) (-drop N LIST)), in no more
- than one pass through the list.
+ Return a list of ((-take N LIST) (-drop N LIST)), in no more than
+ one pass through the list.
(-split-at 3 '(1 2 3 4 5))
- => '((1 2 3) (4 5))
+ ⇒ '((1 2 3) (4 5))
(-split-at 17 '(1 2 3 4 5))
- => '((1 2 3 4 5) nil)
+ ⇒ '((1 2 3 4 5) nil)
-- 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.
+ Return a list of ((-take-while PRED LIST) (-drop-while PRED LIST)),
+ in no more than one pass through the list.
(-split-with 'even? '(1 2 3 4))
- => '(nil (1 2 3 4))
+ ⇒ '(nil (1 2 3 4))
(-split-with 'even? '(2 4 5 6))
- => '((2 4) (5 6))
+ ⇒ '((2 4) (5 6))
(--split-with (< it 4) '(1 2 3 4 3 2 1))
- => '((1 2 3) (4 3 2 1))
+ ⇒ '((1 2 3) (4 3 2 1))
- -- Function: -split-on (item list)
+ -- Macro: -split-on (item list)
Split the LIST each time ITEM is found.
- Unlike `-partition-by' (*note -partition-by::), the ITEM is
- discarded from the results. Empty lists are also removed from
- the result.
+ Unlike ‘-partition-by’ (*note -partition-by::), the ITEM is
+ discarded from the results. Empty lists are also removed from the
+ result.
- Comparison is done by `equal'.
+ Comparison is done by ‘equal’.
- See also `-split-when' (*note -split-when::)
+ See also ‘-split-when’ (*note -split-when::)
(-split-on '| '(Nil | Leaf a | Node [Tree a]))
- => '((Nil) (Leaf a) (Node [Tree a]))
+ ⇒ '((Nil) (Leaf a) (Node [Tree a]))
(-split-on ':endgroup '("a" "b" :endgroup "c" :endgroup "d" "e"))
- => '(("a" "b") ("c") ("d" "e"))
+ ⇒ '(("a" "b") ("c") ("d" "e"))
(-split-on ':endgroup '("a" "b" :endgroup :endgroup "d" "e"))
- => '(("a" "b") ("d" "e"))
+ ⇒ '(("a" "b") ("d" "e"))
-- Function: -split-when (fn list)
Split the LIST on each element where FN returns non-nil.
- Unlike `-partition-by' (*note -partition-by::), the "matched"
+ Unlike ‘-partition-by’ (*note -partition-by::), the "matched"
element is discarded from the results. Empty lists are also
removed from the result.
This function can be thought of as a generalization of
- `split-string'.
+ ‘split-string’.
(-split-when 'even? '(1 2 3 4 5 6))
- => '((1) (3) (5))
+ ⇒ '((1) (3) (5))
(-split-when 'even? '(1 2 3 4 6 8 9))
- => '((1) (3) (9))
+ ⇒ '((1) (3) (9))
(--split-when (memq it '(&optional &rest)) '(a b &optional c d &rest
args))
- => '((a b) (c d) (args))
+ ⇒ '((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.
+ Return a list of ((-filter PRED LIST) (-remove PRED LIST)), in one
+ pass through the list.
(-separate (lambda (num) (= 0 (% num 2))) '(1 2 3 4 5 6 7))
- => '((2 4 6) (1 3 5 7))
+ ⇒ '((2 4 6) (1 3 5 7))
(--separate (< it 5) '(3 7 5 9 3 2 1 4 6))
- => '((3 3 2 1 4) (7 5 9 6))
+ ⇒ '((3 3 2 1 4) (7 5 9 6))
(-separate 'cdr '((1 2) (1) (1 2 3) (4)))
- => '(((1 2) (1 2 3)) ((1) (4)))
+ ⇒ '(((1 2) (1 2 3)) ((1) (4)))
-- Function: -partition (n list)
Return a new list with the items in LIST grouped into N-sized
@@ -1059,81 +1117,81 @@ Functions partitioning the input list into a list of
lists.
N-sized, those items are discarded.
(-partition 2 '(1 2 3 4 5 6))
- => '((1 2) (3 4) (5 6))
+ ⇒ '((1 2) (3 4) (5 6))
(-partition 2 '(1 2 3 4 5 6 7))
- => '((1 2) (3 4) (5 6))
+ ⇒ '((1 2) (3 4) (5 6))
(-partition 3 '(1 2 3 4 5 6 7))
- => '((1 2 3) (4 5 6))
+ ⇒ '((1 2 3) (4 5 6))
-- Function: -partition-all (n list)
Return a new list with the items in LIST grouped into N-sized
sublists. The last group may contain less than N items.
(-partition-all 2 '(1 2 3 4 5 6))
- => '((1 2) (3 4) (5 6))
+ ⇒ '((1 2) (3 4) (5 6))
(-partition-all 2 '(1 2 3 4 5 6 7))
- => '((1 2) (3 4) (5 6) (7))
+ ⇒ '((1 2) (3 4) (5 6) (7))
(-partition-all 3 '(1 2 3 4 5 6 7))
- => '((1 2 3) (4 5 6) (7))
+ ⇒ '((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.
+ sublists at offsets STEP apart. 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))
+ ⇒ '((1 2) (2 3) (3 4))
(-partition-in-steps 3 2 '(1 2 3 4))
- => '((1 2 3))
+ ⇒ '((1 2 3))
(-partition-in-steps 3 2 '(1 2 3 4 5))
- => '((1 2 3) (3 4 5))
+ ⇒ '((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.
+ sublists at offsets STEP apart. The last groups may contain less
+ than N items.
(-partition-all-in-steps 2 1 '(1 2 3 4))
- => '((1 2) (2 3) (3 4) (4))
+ ⇒ '((1 2) (2 3) (3 4) (4))
(-partition-all-in-steps 3 2 '(1 2 3 4))
- => '((1 2 3) (3 4))
+ ⇒ '((1 2 3) (3 4))
(-partition-all-in-steps 3 2 '(1 2 3 4 5))
- => '((1 2 3) (3 4 5) (5))
+ ⇒ '((1 2 3) (3 4 5) (5))
-- Function: -partition-by (fn list)
- Apply FN to each item in LIST, splitting it each time FN returns
- a new value.
+ Apply FN to each item in LIST, splitting it each time FN returns a
+ new value.
(-partition-by 'even? '())
- => '()
+ ⇒ '()
(-partition-by 'even? '(1 1 2 2 2 3 4 6 8))
- => '((1 1) (2 2 2) (3) (4 6 8))
+ ⇒ '((1 1) (2 2 2) (3) (4 6 8))
(--partition-by (< it 3) '(1 2 3 4 3 2 1))
- => '((1 2) (3 4 3) (2 1))
+ ⇒ '((1 2) (3 4 3) (2 1))
-- Function: -partition-by-header (fn list)
- Apply FN to the first item in LIST. That is the header value.
+ Apply FN to the first item in LIST. That is the header value.
Apply FN to each item in LIST, splitting it each time FN returns
the header value, but only after seeing at least one other value
(the body).
(--partition-by-header (= it 1) '(1 2 3 1 2 1 2 3 4))
- => '((1 2 3) (1 2) (1 2 3 4))
+ ⇒ '((1 2 3) (1 2) (1 2 3 4))
(--partition-by-header (> it 0) '(1 2 0 1 0 1 2 3 0))
- => '((1 2 0) (1 0) (1 2 3 0))
+ ⇒ '((1 2 0) (1 0) (1 2 3 0))
(-partition-by-header 'even? '(2 1 1 1 4 1 3 5 6 6 1))
- => '((2 1 1 1) (4 1 3 5) (6 6 1))
+ ⇒ '((2 1 1 1) (4 1 3 5) (6 6 1))
-- Function: -group-by (fn list)
Separate LIST into an alist whose keys are FN applied to the
- elements of LIST. Keys are compared by `equal'.
+ elements of LIST. Keys are compared by ‘equal’.
(-group-by 'even? '())
- => '()
+ ⇒ '()
(-group-by 'even? '(1 1 2 2 2 3 4 6 8))
- => '((nil 1 1 3) (t 2 2 2 4 6 8))
+ ⇒ '((nil 1 1 3) (t 2 2 2 4 6 8))
(--group-by (car (split-string it "/")) '("a/b" "c/d" "a/e"))
- => '(("a" "a/b" "a/e") ("c" "c/d"))
+ ⇒ '(("a" "a/b" "a/e") ("c" "c/d"))
File: dash.info, Node: Indexing, Next: Set operations, Prev: Partitioning,
Up: Functions
@@ -1141,8 +1199,8 @@ File: dash.info, Node: Indexing, Next: Set operations,
Prev: Partitioning, U
2.8 Indexing
============
-Return indices of elements based on predicates, sort elements by
-indices etc.
+Return indices of elements based on predicates, sort elements by indices
+etc.
-- Function: -elem-index (elem list)
Return the index of the first element in the given LIST which is
@@ -1150,57 +1208,61 @@ indices etc.
element.
(-elem-index 2 '(6 7 8 2 3 4))
- => 3
+ ⇒ 3
(-elem-index "bar" '("foo" "bar" "baz"))
- => 1
+ ⇒ 1
(-elem-index '(1 2) '((3) (5 6) (1 2) nil))
- => 2
+ ⇒ 2
-- Function: -elem-indices (elem list)
Return the indices of all elements in LIST equal to the query
element ELEM, in ascending order.
(-elem-indices 2 '(6 7 8 2 3 4 2 1))
- => '(3 6)
+ ⇒ '(3 6)
(-elem-indices "bar" '("foo" "bar" "baz"))
- => '(1)
+ ⇒ '(1)
(-elem-indices '(1 2) '((3) (1 2) (5 6) (1 2) nil))
- => '(1 3)
+ ⇒ '(1 3)
-- 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.
+ 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.
+
+ See also ‘-first’ (*note -first::).
(-find-index 'even? '(2 4 1 6 3 3 5 8))
- => 0
+ ⇒ 0
(--find-index (< 5 it) '(2 4 1 6 3 3 5 8))
- => 3
+ ⇒ 3
(-find-index (-partial 'string-lessp "baz") '("bar" "foo" "baz"))
- => 1
+ ⇒ 1
-- 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.
+ 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.
+
+ See also ‘-last’ (*note -last::).
(-find-last-index 'even? '(2 4 1 6 3 3 5 8))
- => 7
+ ⇒ 7
(--find-last-index (< 5 it) '(2 7 1 6 3 8 5 2))
- => 5
+ ⇒ 5
(-find-last-index (-partial 'string-lessp "baz") '("q" "foo" "baz"))
- => 1
+ ⇒ 1
-- Function: -find-indices (pred list)
- Return the indices of all elements in LIST satisfying the
- predicate PRED, in ascending order.
+ Return the indices of all elements in LIST satisfying the predicate
+ PRED, in ascending order.
(-find-indices 'even? '(2 4 1 6 3 3 5 8))
- => '(0 1 3 7)
+ ⇒ '(0 1 3 7)
(--find-indices (< 5 it) '(2 4 1 6 3 3 5 8))
- => '(3 7)
+ ⇒ '(3 7)
(-find-indices (-partial 'string-lessp "baz") '("bar" "foo" "baz"))
- => '(1)
+ ⇒ '(1)
-- Function: -grade-up (comparator list)
Grade elements of LIST using COMPARATOR relation, yielding a
@@ -1208,9 +1270,9 @@ indices etc.
sorts it in ascending order.
(-grade-up '< '(3 1 4 2 1 3 3))
- => '(1 4 3 0 5 6 2)
+ ⇒ '(1 4 3 0 5 6 2)
(let ((l '(3 1 4 2 1 3 3))) (-select-by-indices (-grade-up '< l) l))
- => '(1 1 2 3 3 3 4)
+ ⇒ '(1 1 2 3 3 3 4)
-- Function: -grade-down (comparator list)
Grade elements of LIST using COMPARATOR relation, yielding a
@@ -1218,9 +1280,9 @@ indices etc.
sorts it in descending order.
(-grade-down '< '(3 1 4 2 1 3 3))
- => '(2 0 5 6 3 1 4)
+ ⇒ '(2 0 5 6 3 1 4)
(let ((l '(3 1 4 2 1 3 3))) (-select-by-indices (-grade-down '< l)
l))
- => '(4 3 3 3 2 1 1)
+ ⇒ '(4 3 3 3 2 1 1)
File: dash.info, Node: Set operations, Next: Other list operations, Prev:
Indexing, Up: Functions
@@ -1231,52 +1293,52 @@ 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 LIST1 and elements
- of LIST2 that are not in LIST1. The test for equality is done
- with `equal', or with `-compare-fn' if that's non-nil.
+ 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.
(-union '(1 2 3) '(3 4 5))
- => '(1 2 3 4 5)
+ ⇒ '(1 2 3 4 5)
(-union '(1 2 3 4) '())
- => '(1 2 3 4)
+ ⇒ '(1 2 3 4)
(-union '(1 1 2 2) '(3 2 1))
- => '(1 1 2 2 3)
+ ⇒ '(1 1 2 2 3)
-- 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.
+ LIST2. The test for equality is done with ‘equal’, or with
+ ‘-compare-fn’ if that’s non-nil.
(-difference '() '())
- => '()
+ ⇒ '()
(-difference '(1 2 3) '(4 5 6))
- => '(1 2 3)
+ ⇒ '(1 2 3)
(-difference '(1 2 3 4) '(3 4 5 6))
- => '(1 2)
+ ⇒ '(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 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.
(-intersection '() '())
- => '()
+ ⇒ '()
(-intersection '(1 2 3) '(4 5 6))
- => '()
+ ⇒ '()
(-intersection '(1 2 3 4) '(3 4 5 6))
- => '(3 4)
+ ⇒ '(3 4)
-- 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
+ equality is done with ‘equal’, or with ‘-compare-fn’ if that’s
non-nil.
- Alias: `-uniq'
+ Alias: ‘-uniq’
(-distinct '())
- => '()
+ ⇒ '()
(-distinct '(1 2 2 4))
- => '(1 2 4)
+ ⇒ '(1 2 4)
File: dash.info, Node: Other list operations, Next: Tree operations, Prev:
Set operations, Up: Functions
@@ -1287,73 +1349,73 @@ File: dash.info, Node: Other list operations, Next:
Tree operations, Prev: Se
Other list functions not fit to be classified elsewhere.
-- Function: -rotate (n list)
- Rotate LIST N places to the right. With N negative, rotate to
- the left. The time complexity is O(n).
+ Rotate LIST N places to the right. With N negative, rotate to the
+ left. The time complexity is O(n).
(-rotate 3 '(1 2 3 4 5 6 7))
- => '(5 6 7 1 2 3 4)
+ ⇒ '(5 6 7 1 2 3 4)
(-rotate -3 '(1 2 3 4 5 6 7))
- => '(4 5 6 7 1 2 3)
+ ⇒ '(4 5 6 7 1 2 3)
-- Function: -repeat (n x)
Return a list with X repeated N times. Return nil if N is less
than 1.
(-repeat 3 :a)
- => '(:a :a :a)
+ ⇒ '(:a :a :a)
(-repeat 1 :a)
- => '(:a)
+ ⇒ '(:a)
(-repeat 0 :a)
- => nil
+ ⇒ nil
-- Function: -cons* (&rest args)
Make a new list from the elements of ARGS.
- The last 2 members of ARGS are used as the final cons of the
- result so if the final member of ARGS is not a list the result is
- a dotted list.
+ The last 2 members of ARGS are used as the final cons of the result
+ so if the final member of ARGS is not a list the result is a dotted
+ list.
(-cons* 1 2)
- => '(1 . 2)
+ ⇒ '(1 . 2)
(-cons* 1 2 3)
- => '(1 2 . 3)
+ ⇒ '(1 2 . 3)
(-cons* 1)
- => 1
+ ⇒ 1
-- Function: -snoc (list elem &rest elements)
Append ELEM to the end of the list.
- This is like `cons', but operates on the end of list.
+ This is like ‘cons’, but operates on the end of list.
If ELEMENTS is non nil, append these to the list as well.
(-snoc '(1 2 3) 4)
- => '(1 2 3 4)
+ ⇒ '(1 2 3 4)
(-snoc '(1 2 3) 4 5 6)
- => '(1 2 3 4 5 6)
+ ⇒ '(1 2 3 4 5 6)
(-snoc '(1 2 3) '(4 5 6))
- => '(1 2 3 (4 5 6))
+ ⇒ '(1 2 3 (4 5 6))
-- Function: -interpose (sep list)
Return a new list of all elements in LIST separated by SEP.
(-interpose "-" '())
- => '()
+ ⇒ '()
(-interpose "-" '("a"))
- => '("a")
+ ⇒ '("a")
(-interpose "-" '("a" "b" "c"))
- => '("a" "-" "b" "-" "c")
+ ⇒ '("a" "-" "b" "-" "c")
-- Function: -interleave (&rest lists)
- Return a new list of the first item in each list, then the
- second etc.
+ Return a new list of the first item in each list, then the second
+ etc.
(-interleave '(1 2) '("a" "b"))
- => '(1 "a" 2 "b")
+ ⇒ '(1 "a" 2 "b")
(-interleave '(1 2) '("a" "b") '("A" "B"))
- => '(1 "a" "A" 2 "b" "B")
+ ⇒ '(1 "a" "A" 2 "b" "B")
(-interleave '(1 2 3) '("a" "b"))
- => '(1 "a" 2 "b")
+ ⇒ '(1 "a" 2 "b")
-- Function: -zip-with (fn list1 list2)
Zip the two lists LIST1 and LIST2 using a function FN. This
@@ -1361,62 +1423,66 @@ Other list functions not fit to be classified elsewhere.
LIST1 and as second argument element of LIST2 at corresponding
position.
- The anaphoric form `--zip-with' binds the elements from LIST1 as
- `it`, and the elements from LIST2 as `other`.
+ The anaphoric form ‘--zip-with’ binds the elements from LIST1 as
+ ‘it‘, and the elements from LIST2 as ‘other‘.
(-zip-with '+ '(1 2 3) '(4 5 6))
- => '(5 7 9)
+ ⇒ '(5 7 9)
(-zip-with 'cons '(1 2 3) '(4 5 6))
- => '((1 . 4) (2 . 5) (3 . 6))
+ ⇒ '((1 . 4) (2 . 5) (3 . 6))
(--zip-with (concat it " and " other) '("Batman" "Jekyll") '("Robin"
"Hyde"))
- => '("Batman and Robin" "Jekyll and Hyde")
+ ⇒ '("Batman and Robin" "Jekyll and Hyde")
-- Function: -zip (&rest lists)
Zip LISTS together. Group the head of each list, followed by the
- second elements of each list, and so on. The lengths of the
+ second elements of each list, and so on. The lengths of the
returned groupings are equal to the length of the shortest input
list.
- If two lists are provided as arguments, return the groupings as
- a list of cons cells. Otherwise, return the groupings as a list
- of lists.
+ If two lists are provided as arguments, return the groupings as a
+ list of cons cells. Otherwise, return the groupings as a list of
+ lists.
+
+ Please note! This distinction is being removed in an upcoming 2.0
+ release of Dash. If you rely on this behavior, use -zip-pair
+ instead.
(-zip '(1 2 3) '(4 5 6))
- => '((1 . 4) (2 . 5) (3 . 6))
+ ⇒ '((1 . 4) (2 . 5) (3 . 6))
(-zip '(1 2 3) '(4 5 6 7))
- => '((1 . 4) (2 . 5) (3 . 6))
+ ⇒ '((1 . 4) (2 . 5) (3 . 6))
(-zip '(1 2 3 4) '(4 5 6))
- => '((1 . 4) (2 . 5) (3 . 6))
+ ⇒ '((1 . 4) (2 . 5) (3 . 6))
-- Function: -zip-fill (fill-value &rest lists)
- Zip LISTS, with FILL-VALUE padded onto the shorter lists. The
+ Zip LISTS, with FILL-VALUE padded onto the shorter lists. The
lengths of the returned groupings are equal to the length of the
longest input list.
(-zip-fill 0 '(1 2 3 4 5) '(6 7 8 9))
- => '((1 . 6) (2 . 7) (3 . 8) (4 . 9) (5 . 0))
+ ⇒ '((1 . 6) (2 . 7) (3 . 8) (4 . 9) (5 . 0))
-- Function: -cycle (list)
Return an infinite copy of LIST that will cycle through the
elements and repeat from the beginning.
(-take 5 (-cycle '(1 2 3)))
- => '(1 2 3 1 2)
+ ⇒ '(1 2 3 1 2)
(-take 7 (-cycle '(1 "and" 3)))
- => '(1 "and" 3 1 "and" 3 1)
+ ⇒ '(1 "and" 3 1 "and" 3 1)
(-zip (-cycle '(1 2 3)) '(1 2))
- => '((1 . 1) (2 . 2))
+ ⇒ '((1 . 1) (2 . 2))
-- Function: -pad (fill-value &rest lists)
- Appends FILL-VALUE to the end of each list in LISTS such that
- they will all have the same length.
+ Appends FILL-VALUE to the end of each list in LISTS such that they
+ will all have the same length.
(-pad 0 '())
- => '(nil)
+ ⇒ '(nil)
(-pad 0 '(1))
- => '((1))
+ ⇒ '((1))
(-pad 0 '(1 2 3) '(4 5))
- => '((1 2 3) (4 5 0))
+ ⇒ '((1 2 3) (4 5 0))
-- Function: -table (fn &rest lists)
Compute outer product of LISTS using function FN.
@@ -1425,17 +1491,17 @@ Other list functions not fit to be classified elsewhere.
supplied lists.
The outer product is computed by applying fn to all possible
- combinations created by taking one element from each list in
- order. The dimension of the result is (length lists).
+ combinations created by taking one element from each list in order.
+ The dimension of the result is (length lists).
- See also: `-table-flat' (*note -table-flat::)
+ See also: ‘-table-flat’ (*note -table-flat::)
(-table '* '(1 2 3) '(1 2 3))
- => '((1 2 3) (2 4 6) (3 6 9))
+ ⇒ '((1 2 3) (2 4 6) (3 6 9))
(-table (lambda (a b) (-sum (-zip-with '* a b))) '((1 2) (3 4)) '((1
3) (2 4)))
- => '((7 15) (10 22))
+ ⇒ '((7 15) (10 22))
(apply '-table 'list (-repeat 3 '(1 2)))
- => '((((1 1 1) (2 1 1)) ((1 2 1) (2 2 1))) (((1 1 2) (2 1 2))
((1 2 2) (2 2 2))))
+ ⇒ '((((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: -table-flat (fn &rest lists)
Compute flat outer product of LISTS using function FN.
@@ -1444,100 +1510,99 @@ Other list functions not fit to be classified
elsewhere.
supplied lists.
The outer product is computed by applying fn to all possible
- combinations created by taking one element from each list in
- order. The results are flattened, ignoring the tensor structure
- of the result. This is equivalent to calling:
+ combinations created by taking one element from each list in order.
+ The results are flattened, ignoring the tensor structure of the
+ result. This is equivalent to calling:
(-flatten-n (1- (length lists)) (-table fn lists))
but the implementation here is much more efficient.
- See also: `-flatten-n' (*note -flatten-n::), `-table' (*note
+ See also: ‘-flatten-n’ (*note -flatten-n::), ‘-table’ (*note
-table::)
(-table-flat 'list '(1 2 3) '(a b c))
- => '((1 a) (2 a) (3 a) (1 b) (2 b) (3 b) (1 c) (2 c) (3 c))
+ ⇒ '((1 a) (2 a) (3 a) (1 b) (2 b) (3 b) (1 c) (2 c) (3 c))
(-table-flat '* '(1 2 3) '(1 2 3))
- => '(1 2 3 2 4 6 3 6 9)
+ ⇒ '(1 2 3 2 4 6 3 6 9)
(apply '-table-flat 'list (-repeat 3 '(1 2)))
- => '((1 1 1) (2 1 1) (1 2 1) (2 2 1) (1 1 2) (2 1 2) (1 2 2) (2
2 2))
+ ⇒ '((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 x in LIST where (PRED x) is non-nil, else nil.
- To get the first item in the list no questions asked, use `car'.
+ To get the first item in the list no questions asked, use ‘car’.
- Alias: `-find'
+ Alias: ‘-find’
(-first 'even? '(1 2 3))
- => 2
+ ⇒ 2
(-first 'even? '(1 3 5))
- => nil
+ ⇒ nil
(--first (> it 2) '(1 2 3))
- => 3
+ ⇒ 3
-- 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'
+ Alias: ‘-any’
(-some 'even? '(1 2 3))
- => t
+ ⇒ t
(--some (member 'foo it) '((foo bar) (baz)))
- => '(foo bar)
+ ⇒ '(foo bar)
(--some (plist-get it :bar) '((:foo 1 :bar 2) (:baz 3)))
- => 2
+ ⇒ 2
-- Function: -last (pred list)
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
+ ⇒ 6
(-last 'even? '(1 3 7 5 9))
- => nil
+ ⇒ nil
(--last (> (length it) 3) '("a" "looong" "word" "and" "short" "one"))
- => "short"
+ ⇒ "short"
-- Function: -first-item (list)
Return the first item of LIST, or nil on an empty list.
(-first-item '(1 2 3))
- => 1
+ ⇒ 1
(-first-item nil)
- => nil
+ ⇒ nil
-- Function: -last-item (list)
Return the last item of LIST, or nil on an empty list.
(-last-item '(1 2 3))
- => 3
+ ⇒ 3
(-last-item nil)
- => nil
+ ⇒ nil
-- Function: -butlast (list)
Return a list of all items in list except for the last.
(-butlast '(1 2 3))
- => '(1 2)
+ ⇒ '(1 2)
(-butlast '(1 2))
- => '(1)
+ ⇒ '(1)
(-butlast '(1))
- => nil
+ ⇒ nil
-- 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.
+ 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.
(-sort '< '(3 1 2))
- => '(1 2 3)
+ ⇒ '(1 2 3)
(-sort '> '(3 1 2))
- => '(3 2 1)
+ ⇒ '(3 2 1)
(--sort (< it other) '(3 1 2))
- => '(1 2 3)
+ ⇒ '(1 2 3)
-- Function: -list (&rest args)
Return a list with ARGS.
@@ -1546,21 +1611,21 @@ Other list functions not fit to be classified elsewhere.
not, return a list with ARGS as elements.
(-list 1)
- => '(1)
+ ⇒ '(1)
(-list 1 2 3)
- => '(1 2 3)
+ ⇒ '(1 2 3)
(-list '(1 2 3))
- => '(1 2 3)
+ ⇒ '(1 2 3)
-- Function: -fix (fn list)
Compute the (least) fixpoint of FN with initial input LIST.
- FN is called at least once, results are compared with `equal'.
+ FN is called at least once, results are compared with ‘equal’.
(-fix (lambda (l) (-non-nil (--mapcat (-split-at (/ (length it) 2)
it) l))) '((1 2 3 4 5 6)))
- => '((1) (2) (3) (4) (5) (6))
+ ⇒ '((1) (2) (3) (4) (5) (6))
(let ((data '(("starwars" "scifi") ("jedi" "starwars" "warrior"))))
(--fix (-uniq (--mapcat (cons it (cdr (assoc it data))) it)) '("jedi" "book")))
- => '("jedi" "starwars" "warrior" "scifi" "book")
+ ⇒ '("jedi" "starwars" "warrior" "scifi" "book")
File: dash.info, Node: Tree operations, Next: Threading macros, Prev: Other
list operations, Up: Functions
@@ -1578,42 +1643,41 @@ Functions pretending lists are trees.
passed argument is a branch, that is, a node that can have
children.
- CHILDREN is a function of one argument that returns the children
- of the passed branch node.
+ CHILDREN is a function of one argument that returns the children of
+ the passed branch node.
Non-branch nodes are simply copied.
(-tree-seq 'listp 'identity '(1 (2 3) 4 (5 (6 7))))
- => '((1 (2 3) 4 (5 (6 7))) 1 (2 3) 2 3 4 (5 (6 7)) 5 (6 7) 6 7)
+ ⇒ '((1 (2 3) 4 (5 (6 7))) 1 (2 3) 2 3 4 (5 (6 7)) 5 (6 7) 6 7)
(-tree-seq 'listp 'reverse '(1 (2 3) 4 (5 (6 7))))
- => '((1 (2 3) 4 (5 (6 7))) (5 (6 7)) (6 7) 7 6 5 4 (2 3) 3 2 1)
+ ⇒ '((1 (2 3) 4 (5 (6 7))) (5 (6 7)) (6 7) 7 6 5 4 (2 3) 3 2 1)
(--tree-seq (vectorp it) (append it nil) [1 [2 3] 4 [5 [6 7]]])
- => '([1 [2 3] 4 [5 [6 7]]] 1 [2 3] 2 3 4 [5 [6 7]] 5 [6 7] 6 7)
+ ⇒ '([1 [2 3] 4 [5 [6 7]]] 1 [2 3] 2 3 4 [5 [6 7]] 5 [6 7] 6 7)
-- Function: -tree-map (fn tree)
Apply FN to each element of TREE while preserving the tree
structure.
(-tree-map '1+ '(1 (2 3) (4 (5 6) 7)))
- => '(2 (3 4) (5 (6 7) 8))
+ ⇒ '(2 (3 4) (5 (6 7) 8))
(-tree-map '(lambda (x) (cons x (expt 2 x))) '(1 (2 3) 4))
- => '((1 . 2) ((2 . 4) (3 . 8)) (4 . 16))
+ ⇒ '((1 . 2) ((2 . 4) (3 . 8)) (4 . 16))
(--tree-map (length it) '("<body>" ("<p>" "text" "</p>") "</body>"))
- => '(6 (3 4 4) 7)
+ ⇒ '(6 (3 4 4) 7)
-- 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.
+ 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))
+ ⇒ '(1 5 4 (5 13 8))
(-tree-map-nodes 'keywordp (lambda (x) (symbol-name x)) '(1 :foo 4
((5 6 :bar) :baz 8)))
- => '(1 ":foo" 4 ((5 6 ":bar") ":baz" 8))
+ ⇒ '(1 ":foo" 4 ((5 6 ":bar") ":baz" 8))
(--tree-map-nodes (eq (car-safe it) 'add-mode) (-concat it (list
:mode 'emacs-lisp-mode)) '(with-mode emacs-lisp-mode (foo bar) (add-mode a b)
(baz (add-mode c d))))
- => '(with-mode emacs-lisp-mode (foo bar) (add-mode a b :mode
emacs-lisp-mode) (baz (add-mode c d :mode emacs-lisp-mode)))
+ ⇒ '(with-mode emacs-lisp-mode (foo bar) (add-mode a b :mode
emacs-lisp-mode) (baz (add-mode c d :mode emacs-lisp-mode)))
-- Function: -tree-reduce (fn tree)
Use FN to reduce elements of list TREE. If elements of TREE are
@@ -1622,15 +1686,15 @@ Functions pretending lists are trees.
FN is first applied to first element of the list and second
element, then on this result and third element from the list etc.
- See `-reduce-r' (*note -reduce-r::) for how exactly are lists of
+ See ‘-reduce-r’ (*note -reduce-r::) for how exactly are lists of
zero or one element handled.
(-tree-reduce '+ '(1 (2 3) (4 5)))
- => 15
+ ⇒ 15
(-tree-reduce 'concat '("strings" (" on" " various") ((" levels"))))
- => "strings on various levels"
+ ⇒ "strings on various levels"
(--tree-reduce (cond ((stringp it) (concat it " " acc)) (t (let ((sn
(symbol-name it))) (concat "<" sn ">" acc "</" sn ">")))) '(body (p "some
words") (div "more" (b "bold") "words")))
- => "<body><p>some words</p> <div>more <b>bold</b>
words</div></body>"
+ ⇒ "<body><p>some words</p> <div>more <b>bold</b>
words</div></body>"
-- Function: -tree-reduce-from (fn init-value tree)
Use FN to reduce elements of list TREE. If elements of TREE are
@@ -1643,9 +1707,9 @@ Functions pretending lists are trees.
two elements.
(-tree-reduce-from '+ 1 '(1 (1 1) ((1))))
- => 8
+ ⇒ 8
(--tree-reduce-from (-concat acc (list it)) nil '(1 (2 3 (4 5)) (6
7)))
- => '((7 6) ((5 4) 3 2) 1)
+ ⇒ '((7 6) ((5 4) 3 2) 1)
-- Function: -tree-mapreduce (fn folder tree)
Apply FN to each element of TREE, and make a list of the results.
@@ -1653,18 +1717,18 @@ Functions pretending lists are trees.
elements of these nested lists.
Then reduce the resulting lists using FOLDER and initial value
- INIT-VALUE. See `-reduce-r-from' (*note -reduce-r-from::).
+ INIT-VALUE. See ‘-reduce-r-from’ (*note -reduce-r-from::).
- This is the same as calling `-tree-reduce' (*note
- -tree-reduce::) after `-tree-map' (*note -tree-map::) but is
- twice as fast as it only traverse the structure once.
+ This is the same as calling ‘-tree-reduce’ (*note -tree-reduce::)
+ after ‘-tree-map’ (*note -tree-map::) but is twice as fast as it
+ only traverse the structure once.
(-tree-mapreduce 'list 'append '(1 (2 (3 4) (5 6)) (7 (8 9))))
- => '(1 2 3 4 5 6 7 8 9)
+ ⇒ '(1 2 3 4 5 6 7 8 9)
(--tree-mapreduce 1 (+ it acc) '(1 (2 (4 9) (2 1)) (7 (4 3))))
- => 9
+ ⇒ 9
(--tree-mapreduce 0 (max acc (1+ it)) '(1 (2 (4 9) (2 1)) (7 (4 3))))
- => 3
+ ⇒ 3
-- Function: -tree-mapreduce-from (fn folder init-value tree)
Apply FN to each element of TREE, and make a list of the results.
@@ -1672,26 +1736,26 @@ Functions pretending lists are trees.
elements of these nested lists.
Then reduce the resulting lists using FOLDER and initial value
- INIT-VALUE. See `-reduce-r-from' (*note -reduce-r-from::).
+ INIT-VALUE. See ‘-reduce-r-from’ (*note -reduce-r-from::).
- This is the same as calling `-tree-reduce-from' (*note
- -tree-reduce-from::) after `-tree-map' (*note -tree-map::) but
- is twice as fast as it only traverse the structure once.
+ This is the same as calling ‘-tree-reduce-from’ (*note
+ -tree-reduce-from::) after ‘-tree-map’ (*note -tree-map::) but is
+ twice as fast as it only traverse the structure once.
(-tree-mapreduce-from 'identity '* 1 '(1 (2 (3 4) (5 6)) (7 (8 9))))
- => 362880
+ ⇒ 362880
(--tree-mapreduce-from (+ it it) (cons it acc) nil '(1 (2 (4 9) (2
1)) (7 (4 3))))
- => '(2 (4 (8 18) (4 2)) (14 (8 6)))
+ ⇒ '(2 (4 (8 18) (4 2)) (14 (8 6)))
(concat "{" (--tree-mapreduce-from (cond ((-cons-pair? it) (concat
(symbol-name (car it)) " -> " (symbol-name (cdr it)))) (t (concat (symbol-name
it) " : {"))) (concat it (unless (or (equal acc "}") (equal (substring it (1-
(length it))) "{")) ", ") acc) "}" '((elips-mode (foo (bar . booze)) (baz .
qux)) (c-mode (foo . bla) (bum . bam)))))
- => "{elips-mode : {foo : {bar -> booze{, baz -> qux{, c-mode :
{foo -> bla, bum -> bam}}"
+ ⇒ "{elips-mode : {foo : {bar -> booze{, baz -> qux{, c-mode :
{foo -> bla, bum -> bam}}"
-- Function: -clone (list)
- Create a deep copy of LIST. The new list has the same elements
- and structure but all cons are replaced with new ones. This is
- useful when you need to clone a structure such as plist or alist.
+ Create a deep copy of LIST. The new list has the same elements and
+ structure but all cons are replaced with new ones. This is useful
+ when you need to clone a structure such as plist or alist.
(let* ((a '(1 2 3)) (b (-clone a))) (nreverse a) b)
- => '(1 2 3)
+ ⇒ '(1 2 3)
File: dash.info, Node: Threading macros, Next: Binding, Prev: Tree
operations, Up: Functions
@@ -1699,80 +1763,80 @@ File: dash.info, Node: Threading macros, Next:
Binding, Prev: Tree operations
2.12 Threading macros
=====================
- -- Function: -> (x &optional form &rest more)
- Thread the expr through the forms. Insert X as the second item
- in the first form, making a list of it if it is not a list
- already. If there are more forms, insert the first form as the
- second item in second form, etc.
+ -- Macro: -> (x &optional form &rest more)
+ Thread the expr through the forms. Insert X as the second item in
+ the first form, making a list of it if it is not a list already.
+ If there are more forms, insert the first form as the second item
+ in second form, etc.
(-> '(2 3 5))
- => '(2 3 5)
+ ⇒ '(2 3 5)
(-> '(2 3 5) (append '(8 13)))
- => '(2 3 5 8 13)
+ ⇒ '(2 3 5 8 13)
(-> '(2 3 5) (append '(8 13)) (-slice 1 -1))
- => '(3 5 8)
+ ⇒ '(3 5 8)
- -- Function: ->> (x &optional form &rest more)
- Thread the expr through the forms. Insert X as the last item in
+ -- Macro: ->> (x &optional form &rest more)
+ Thread the expr through the forms. Insert X as the last item in
the first form, making a list of it if it is not a list already.
- If there are more forms, insert the first form as the last item
- in second form, etc.
+ If there are more forms, insert the first form as the last item in
+ second form, etc.
(->> '(1 2 3) (-map 'square))
- => '(1 4 9)
+ ⇒ '(1 4 9)
(->> '(1 2 3) (-map 'square) (-remove 'even?))
- => '(1 9)
+ ⇒ '(1 9)
(->> '(1 2 3) (-map 'square) (-reduce '+))
- => 14
+ ⇒ 14
- -- Function: -> (x form &rest more)
- Thread the expr through the forms. Insert X at the position
- signified by the token `it' in the first form. If there are more
- forms, insert the first form at the position signified by `it' in
+ -- Macro: --> (x form &rest more)
+ Thread the expr through the forms. Insert X at the position
+ signified by the token ‘it’ in the first form. If there are more
+ forms, insert the first form at the position signified by ‘it’ in
in second form, etc.
(--> "def" (concat "abc" it "ghi"))
- => "abcdefghi"
+ ⇒ "abcdefghi"
(--> "def" (concat "abc" it "ghi") (upcase it))
- => "ABCDEFGHI"
+ ⇒ "ABCDEFGHI"
(--> "def" (concat "abc" it "ghi") upcase)
- => "ABCDEFGHI"
+ ⇒ "ABCDEFGHI"
- -- Function: -some-> (x &optional form &rest more)
- When expr is non-nil, thread it through the first form (via `->'
+ -- 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
form, etc.
(-some-> '(2 3 5))
- => '(2 3 5)
+ ⇒ '(2 3 5)
(-some-> 5 square)
- => 25
+ ⇒ 25
(-some-> 5 even? square)
- => nil
+ ⇒ nil
- -- Function: -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 form, etc.
+ -- 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
+ form, etc.
(-some->> '(1 2 3) (-map 'square))
- => '(1 4 9)
+ ⇒ '(1 4 9)
(-some->> '(1 3 5) (-last 'even?) (+ 100))
- => nil
+ ⇒ nil
(-some->> '(2 4 6) (-last 'even?) (+ 100))
- => 106
+ ⇒ 106
- -- Function: -some-> (x &optional form &rest more)
- When expr in non-nil, thread it through the first form (via
- `-->' (*note -->::)), and when that result is non-nil, through
- the next form, etc.
+ -- Macro: -some--> (x &optional form &rest more)
+ When expr in non-nil, thread it through the first form (via ‘-->’
+ (*note -->::)), and when that result is non-nil, through the next
+ form, etc.
(-some--> "def" (concat "abc" it "ghi"))
- => "abcdefghi"
+ ⇒ "abcdefghi"
(-some--> nil (concat "abc" it "ghi"))
- => nil
+ ⇒ nil
(-some--> '(1 3 5) (-filter 'even? it) (append it it) (-map 'square
it))
- => nil
+ ⇒ nil
File: dash.info, Node: Binding, Next: Side-effects, Prev: Threading macros,
Up: Functions
@@ -1780,64 +1844,63 @@ File: dash.info, Node: Binding, Next: Side-effects,
Prev: Threading macros,
2.13 Binding
============
-Convenient versions of `let` and `let*` constructs combined with flow
+Convenient versions of ‘let‘ and ‘let*‘ constructs combined with flow
control.
- -- Function: -when-let (var-val &rest body)
+ -- Macro: -when-let (var-val &rest body)
If VAL evaluates to non-nil, bind it to VAR and execute body.
VAR-VAL should be a (VAR VAL) pair.
- Note: binding is done according to `-let' (*note -let::).
+ Note: binding is done according to ‘-let’ (*note -let::).
(-when-let (match-index (string-match "d" "abcd")) (+ match-index 2))
- => 5
+ ⇒ 5
(-when-let ((&plist :foo foo) (list :foo "foo")) foo)
- => "foo"
+ ⇒ "foo"
(-when-let ((&plist :foo foo) (list :bar "bar")) foo)
- => nil
+ ⇒ nil
- -- Function: -when-let* (vars-vals &rest body)
- If all VALS evaluate to true, bind them to their corresponding
- VARS and execute body. VARS-VALS should be a list of (VAR VAL)
- pairs.
+ -- Macro: -when-let* (vars-vals &rest body)
+ If all VALS evaluate to true, bind them to their corresponding VARS
+ and execute body. VARS-VALS should be a list of (VAR VAL) pairs.
- Note: binding is done according to `-let*' (*note -let*::).
- VALS are evaluated sequentially, and evaluation stops after the
- first nil VAL is encountered.
+ Note: binding is done according to ‘-let*’ (*note -let*::). VALS
+ are evaluated sequentially, and evaluation stops after the first
+ nil VAL is encountered.
(-when-let* ((x 5) (y 3) (z (+ y 4))) (+ x y z))
- => 15
+ ⇒ 15
(-when-let* ((x 5) (y nil) (z 7)) (+ x y z))
- => nil
+ ⇒ nil
- -- Function: -if-let (var-val then &rest else)
- If VAL evaluates to non-nil, bind it to VAR and do THEN,
- otherwise do ELSE. VAR-VAL should be a (VAR VAL) pair.
+ -- Macro: -if-let (var-val then &rest else)
+ If VAL evaluates to non-nil, bind it to VAR and do THEN, otherwise
+ do ELSE. VAR-VAL should be a (VAR VAL) pair.
- Note: binding is done according to `-let' (*note -let::).
+ Note: binding is done according to ‘-let’ (*note -let::).
(-if-let (match-index (string-match "d" "abc")) (+ match-index 3) 7)
- => 7
+ ⇒ 7
(--if-let (even? 4) it nil)
- => t
+ ⇒ t
- -- Function: -if-let* (vars-vals then &rest else)
- If all VALS evaluate to true, bind them to their corresponding
- VARS and do THEN, otherwise do ELSE. VARS-VALS should be a list
- of (VAR VAL) pairs.
+ -- Macro: -if-let* (vars-vals then &rest else)
+ If all VALS evaluate to true, bind them to their corresponding VARS
+ and do THEN, otherwise do ELSE. VARS-VALS should be a list of (VAR
+ VAL) pairs.
- Note: binding is done according to `-let*' (*note -let*::).
- VALS are evaluated sequentially, and evaluation stops after the
- first nil VAL is encountered.
+ Note: binding is done according to ‘-let*’ (*note -let*::). VALS
+ are evaluated sequentially, and evaluation stops after the first
+ nil VAL is encountered.
(-if-let* ((x 5) (y 3) (z 7)) (+ x y z) "foo")
- => 15
+ ⇒ 15
(-if-let* ((x 5) (y nil) (z 7)) (+ x y z) "foo")
- => "foo"
+ ⇒ "foo"
(-if-let* (((_ _ x) '(nil nil 7))) x)
- => 7
+ ⇒ 7
- -- Function: -let (varlist &rest body)
+ -- Macro: -let (varlist &rest body)
Bind variables according to VARLIST then eval BODY.
VARLIST is a list of lists of the form (PATTERN SOURCE). Each
@@ -1846,12 +1909,12 @@ control.
recursively, and can therefore contain sub-patterns which are
matched against corresponding sub-expressions of SOURCE.
- All the SOURCEs are evalled before any symbols are bound (i.e.
- "in parallel").
+ All the SOURCEs are evalled before any symbols are bound (i.e. "in
+ parallel").
If VARLIST only contains one (PATTERN SOURCE) element, you can
- optionally specify it using a vector and discarding the
- outer-most parens. Thus
+ optionally specify it using a vector and discarding the outer-most
+ parens. Thus
(-let ((PATTERN SOURCE)) ..)
@@ -1859,11 +1922,11 @@ control.
(-let [PATTERN SOURCE] ..).
- `-let' (*note -let::) uses a convention of not binding places
- (symbols) starting with _ whenever it's possible. You can use
- this to skip over entries you don't care about. However, this
- is not *always* possible (as a result of implementation) and
- these symbols might get bound to undefined values.
+ ‘-let’ (*note -let::) uses a convention of not binding places
+ (symbols) starting with _ whenever it’s possible. You can use this
+ to skip over entries you don’t care about. However, this is not
+ *always* possible (as a result of implementation) and these symbols
+ might get bound to undefined values.
Following is the overview of supported patterns. Remember that
patterns can be matched recursively, so every a, b, aK in the
@@ -1872,65 +1935,59 @@ control.
Symbol:
- a - bind the SOURCE to A. This is just like regular `let'.
+ a - bind the SOURCE to A. This is just like regular ‘let’.
Conses and lists:
- (a) - bind `car' of cons/list to A
+ (a) - bind ‘car’ of cons/list to A
- (a . b) - bind car of cons to A and `cdr' to B
+ (a . b) - bind car of cons to A and ‘cdr’ to B
- (a b) - bind car of list to A and `cadr' to B
+ (a b) - bind car of list to A and ‘cadr’ to B
- (a1 a2 a3 ...) - bind 0th car of list to A1, 1st to A2, 2nd to
- A3 ...
+ (a1 a2 a3 ...) - bind 0th car of list to A1, 1st to A2, 2nd to A3
+ ...
- (a1 a2 a3 ... aN . rest) - as above, but bind the Nth cdr to
+ (a1 a2 a3 ... aN . rest) - as above, but bind the Nth cdr to
REST.
Vectors:
[a] - bind 0th element of a non-list sequence to A (works with
- vectors, strings, bit arrays...)
+ vectors, strings, bit arrays...)
- [a1 a2 a3 ...] - bind 0th element of non-list sequence to A0,
- 1st to A1, 2nd to A2, ...
- If the PATTERN is shorter than SOURCE, the values at
- places not in PATTERN are ignored.
- If the PATTERN is longer than SOURCE, an `error' is
- thrown.
+ [a1 a2 a3 ...] - bind 0th element of non-list sequence to A0, 1st
+ to A1, 2nd to A2, ... If the PATTERN is shorter than SOURCE, the
+ values at places not in PATTERN are ignored. If the PATTERN is
+ longer than SOURCE, an ‘error’ is thrown.
- [a1 a2 a3 ... &rest rest] - as above, but bind the rest of
- the sequence to REST. This is
- conceptually the same as improper list
- matching (a1 a2 ... aN . rest)
+ [a1 a2 a3 ... &rest rest] - as above, but bind the rest of the
+ sequence to REST. This is conceptually the same as improper list
+ matching (a1 a2 ... aN . rest)
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.
+ (&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.
- (&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.
+ (&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.
- (&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.
+ (&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.
Further, special keyword &keys supports "inline" matching of
plist-like key-value pairs, similarly to &keys keyword of
- `cl-defun'.
+ ‘cl-defun’.
- (a1 a2 ... aN &keys key1 b1 ... keyN bK)
+ (a1 a2 ... aN &keys key1 b1 ... keyN bK)
- This binds N values from the list to a1 ... aN, then interprets
+ This binds N values from the list to a1 ... aN, then interprets
the cdr as a plist (see key/value matching above).
- You can name the source using the syntax SYMBOL &as PATTERN.
- This syntax works with lists (proper or improper), vectors and
- all types of maps.
+ You can name the source using the syntax SYMBOL &as PATTERN. This
+ syntax works with lists (proper or improper), vectors and all types
+ of maps.
(list &as a b c) (list 1 2 3)
@@ -1938,11 +1995,11 @@ control.
Similarly:
- (bounds &as beg . end) (cons 1 2)
+ (bounds &as beg . end) (cons 1 2)
- binds BEG to 1, END to 2 and BOUNDS to (1 . 2).
+ binds BEG to 1, END to 2 and BOUNDS to (1 . 2).
- (items &as first . rest) (list 1 2 3)
+ (items &as first . rest) (list 1 2 3)
binds FIRST to 1, REST to (2 3) and ITEMS to (1 2 3)
@@ -1959,10 +2016,10 @@ control.
This is especially useful when we want to capture the result of a
computation and destructure at the same time. Consider the form
(function-returning-complex-structure) returning a list of two
- vectors with two items each. We want to capture this entire
- result and pass it to another computation, but at the same time
- we want to get the second item from each vector. We can achieve
- it with pattern
+ vectors with two items each. We want to capture this entire result
+ and pass it to another computation, but at the same time we want to
+ get the second item from each vector. We can achieve it with
+ pattern
(result &as [_ a] [_ b]) (function-returning-complex-structure)
@@ -1971,54 +2028,53 @@ control.
because we need to support improper list binding.
(-let (([a (b c) d] [1 (2 3) 4])) (list a b c d))
- => '(1 2 3 4)
+ ⇒ '(1 2 3 4)
(-let [(a b c . d) (list 1 2 3 4 5 6)] (list a b c d))
- => '(1 2 3 (4 5 6))
+ ⇒ '(1 2 3 (4 5 6))
(-let [(&plist :foo foo :bar bar) (list :baz 3 :foo 1 :qux 4 :bar
2)] (list foo bar))
- => '(1 2)
+ ⇒ '(1 2)
- -- Function: -let* (varlist &rest body)
+ -- Macro: -let* (varlist &rest body)
Bind variables according to VARLIST then eval BODY.
VARLIST is a list of lists of the form (PATTERN SOURCE). Each
- PATTERN is matched against the SOURCE structurally. SOURCE is
- only evaluated once for each PATTERN.
+ PATTERN is matched against the SOURCE structurally. SOURCE is only
+ evaluated once for each PATTERN.
- Each SOURCE can refer to the symbols already bound by this
- VARLIST. This is useful if you want to destructure SOURCE
- recursively but also want to name the intermediate structures.
+ Each SOURCE can refer to the symbols already bound by this VARLIST.
+ This is useful if you want to destructure SOURCE recursively but
+ also want to name the intermediate structures.
- See `-let' (*note -let::) for the list of all possible patterns.
+ See ‘-let’ (*note -let::) for the list of all possible patterns.
(-let* (((a . b) (cons 1 2)) ((c . d) (cons 3 4))) (list a b c d))
- => '(1 2 3 4)
+ ⇒ '(1 2 3 4)
(-let* (((a . b) (cons 1 (cons 2 3))) ((c . d) b)) (list a b c d))
- => '(1 (2 . 3) 2 3)
+ ⇒ '(1 (2 . 3) 2 3)
(-let* (((&alist "foo" foo "bar" bar) (list (cons "foo" 1) (cons
"bar" (list 'a 'b 'c)))) ((a b c) bar)) (list foo a b c bar))
- => '(1 a b c (a b c))
+ ⇒ '(1 a b c (a b c))
- -- Function: -lambda (match-form &rest body)
+ -- Macro: -lambda (match-form &rest body)
Return a lambda which destructures its input as MATCH-FORM and
executes BODY.
Note that you have to enclose the MATCH-FORM in a pair of parens,
such that:
- (-lambda (x) body) (-lambda (x y ...) body)
+ (-lambda (x) body) (-lambda (x y ...) body)
- has the usual semantics of `lambda'. Furthermore, these get
- translated into normal lambda, so there is no performance
- penalty.
+ has the usual semantics of ‘lambda’. Furthermore, these get
+ translated into normal lambda, so there is no performance penalty.
- See `-let' (*note -let::) for the description of destructuring
+ See ‘-let’ (*note -let::) for the description of destructuring
mechanism.
(-map (-lambda ((x y)) (+ x y)) '((1 2) (3 4) (5 6)))
- => '(3 7 11)
+ ⇒ '(3 7 11)
(-map (-lambda ([x y]) (+ x y)) '([1 2] [3 4] [5 6]))
- => '(3 7 11)
+ ⇒ '(3 7 11)
(funcall (-lambda ((_ . a) (_ . b)) (-concat a b)) '(1 2 3) '(4 5 6))
- => '(2 3 5 6)
+ ⇒ '(2 3 5 6)
File: dash.info, Node: Side-effects, Next: Destructive operations, Prev:
Binding, Up: Functions
@@ -2029,33 +2085,57 @@ 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 with every item in LIST. Return nil, used for
- side-effects only.
+ Call FN with every item in LIST. Return nil, used for side-effects
+ only.
(let (s) (-each '(1 2 3) (lambda (item) (setq s (cons item s)))))
- => nil
+ ⇒ nil
(let (s) (-each '(1 2 3) (lambda (item) (setq s (cons item s)))) s)
- => '(3 2 1)
+ ⇒ '(3 2 1)
(let (s) (--each '(1 2 3) (setq s (cons it s))) s)
- => '(3 2 1)
+ ⇒ '(3 2 1)
-- Function: -each-while (list pred fn)
Call FN with every item in LIST while (PRED item) is non-nil.
Return nil, used for side-effects only.
(let (s) (-each-while '(2 4 5 6) 'even? (lambda (item) (!cons item
s))) s)
- => '(4 2)
+ ⇒ '(4 2)
(let (s) (--each-while '(1 2 3 4) (< it 3) (!cons it s)) s)
- => '(2 1)
+ ⇒ '(2 1)
+
+ -- Function: -each-indexed (list fn)
+ Call (FN index item) for each item in LIST.
+
+ In the anaphoric form ‘--each-indexed’, the index is exposed as
+ ‘it-index‘.
+
+ See also: ‘-map-indexed’ (*note -map-indexed::).
+
+ (let (s) (-each-indexed '(a b c) (lambda (index item) (setq s (cons
(list item index) s)))) s)
+ ⇒ '((c 2) (b 1) (a 0))
+ (let (s) (--each-indexed '(a b c) (setq s (cons (list it it-index)
s))) s)
+ ⇒ '((c 2) (b 1) (a 0))
-- Function: -dotimes (num fn)
Repeatedly calls FN (presumably for side-effects) passing in
integers from 0 through NUM-1.
(let (s) (-dotimes 3 (lambda (n) (!cons n s))) s)
- => '(2 1 0)
+ ⇒ '(2 1 0)
(let (s) (--dotimes 5 (!cons it s)) s)
- => '(4 3 2 1 0)
+ ⇒ '(4 3 2 1 0)
+
+ -- Macro: -doto (eval-initial-value &rest forms)
+ Eval a form, then insert that form as the 2nd argument to other
+ forms. The EVAL-INITIAL-VALUE form is evaluated once. Its result
+ is passed to FORMS, which are then evaluated sequentially. Returns
+ the target form.
+
+ (-doto '(1 2 3) (!cdr) (!cdr))
+ ⇒ '(3)
+ (-doto '(1 . 2) (setcar 3) (setcdr 4))
+ ⇒ '(3 . 4)
File: dash.info, Node: Destructive operations, Next: Function combinators,
Prev: Side-effects, Up: Functions
@@ -2063,21 +2143,21 @@ File: dash.info, Node: Destructive operations, Next:
Function combinators, Pr
2.15 Destructive operations
===========================
- -- Function: !cons (car cdr)
+ -- Macro: !cons (car cdr)
Destructive: Set CDR to the cons of CAR and CDR.
(let (l) (!cons 5 l) l)
- => '(5)
+ ⇒ '(5)
(let ((l '(3))) (!cons 5 l) l)
- => '(5 3)
+ ⇒ '(5 3)
- -- Function: !cdr (list)
+ -- Macro: !cdr (list)
Destructive: Set LIST to the cdr of LIST.
(let ((l '(3))) (!cdr l) l)
- => '()
+ ⇒ '()
(let ((l '(3 5))) (!cdr l) l)
- => '(5)
+ ⇒ '(5)
File: dash.info, Node: Function combinators, Prev: Destructive operations,
Up: Functions
@@ -2085,80 +2165,79 @@ File: dash.info, Node: Function combinators, Prev:
Destructive operations, Up
2.16 Function combinators
=========================
-These combinators require Emacs 24 for its lexical scope. So they are
-offered in a separate package: `dash-functional`.
+These combinators require Emacs 24 for its lexical scope. So they are
+offered in a separate package: ‘dash-functional‘.
-- Function: -partial (fn &rest args)
- Takes a function FN and fewer than the normal arguments to FN,
- and returns a fn that takes a variable number of additional ARGS.
- When called, the returned function calls FN with ARGS first and
- then additional args.
+ Takes a function FN and fewer than the normal arguments to FN, and
+ returns a fn that takes a variable number of additional ARGS. When
+ called, the returned function calls FN with ARGS first and then
+ additional args.
(funcall (-partial '- 5) 3)
- => 2
+ ⇒ 2
(funcall (-partial '+ 5 2) 3)
- => 10
+ ⇒ 10
-- Function: -rpartial (fn &rest args)
- Takes a function FN and fewer than the normal arguments to FN,
- and returns a fn that takes a variable number of additional ARGS.
- When called, the returned function calls FN with the additional
- args first and then ARGS.
+ Takes a function FN and fewer than the normal arguments to FN, and
+ returns a fn that takes a variable number of additional ARGS. When
+ called, the returned function calls FN with the additional args
+ first and then ARGS.
(funcall (-rpartial '- 5) 8)
- => 3
+ ⇒ 3
(funcall (-rpartial '- 5 2) 10)
- => 3
+ ⇒ 3
-- Function: -juxt (&rest fns)
Takes a list of functions and returns a fn that is the
- juxtaposition of those fns. The returned fn takes a variable
+ juxtaposition of those fns. The returned fn takes a variable
number of args, and returns a list containing the result of
applying each fn to the args (left-to-right).
(funcall (-juxt '+ '-) 3 5)
- => '(8 -2)
+ ⇒ '(8 -2)
(-map (-juxt 'identity 'square) '(1 2 3))
- => '((1 1) (2 4) (3 9))
+ ⇒ '((1 1) (2 4) (3 9))
-- Function: -compose (&rest fns)
- Takes a list of functions and returns a fn that is the
- composition of those fns. The returned fn takes a variable
- number of arguments, and returns the result of applying each fn
- to the result of applying the previous fn to the arguments
- (right-to-left).
+ Takes a list of functions and returns a fn that is the composition
+ of those fns. The returned fn takes a variable number of
+ arguments, and returns the result of applying each fn to the result
+ of applying the previous fn to the arguments (right-to-left).
(funcall (-compose 'square '+) 2 3)
- => (square (+ 2 3))
+ ⇒ (square (+ 2 3))
(funcall (-compose 'identity 'square) 3)
- => (square 3)
+ ⇒ (square 3)
(funcall (-compose 'square 'identity) 3)
- => (square 3)
+ ⇒ (square 3)
-- Function: -applify (fn)
- Changes an n-arity function FN to a 1-arity function that
- expects a list with n items as arguments
+ Changes an n-arity function FN to a 1-arity function that expects a
+ list with n items as arguments
(-map (-applify '+) '((1 1 1) (1 2 3) (5 5 5)))
- => '(3 6 15)
+ ⇒ '(3 6 15)
(-map (-applify (lambda (a b c) (\` ((\, a) ((\, b) ((\, c)))))))
'((1 1 1) (1 2 3) (5 5 5)))
- => '((1 (1 (1))) (1 (2 (3))) (5 (5 (5))))
+ ⇒ '((1 (1 (1))) (1 (2 (3))) (5 (5 (5))))
(funcall (-applify '<) '(3 6))
- => t
+ ⇒ t
-- Function: -on (operator transformer)
- Return a function of two arguments that first applies
- TRANSFORMER to each of them and then applies OPERATOR on the
- results (in the same order).
+ Return a function of two arguments that first applies TRANSFORMER
+ to each of them and then applies OPERATOR on the results (in the
+ same order).
In types: (b -> b -> c) -> (a -> b) -> a -> a -> c
(-sort (-on '< 'length) '((1 2 3) (1) (1 2)))
- => '((1) (1 2) (1 2 3))
+ ⇒ '((1) (1 2) (1 2 3))
(-min-by (-on '> 'length) '((1 2 3) (4) (1 2)))
- => '(4)
+ ⇒ '(4)
(-min-by (-on 'string-lessp 'int-to-string) '(2 100 22))
- => 22
+ ⇒ 22
-- Function: -flip (func)
Swap the order of arguments for binary function FUNC.
@@ -2166,79 +2245,78 @@ offered in a separate package: `dash-functional`.
In types: (a -> b -> c) -> b -> a -> c
(funcall (-flip '<) 2 1)
- => t
+ ⇒ t
(funcall (-flip '-) 3 8)
- => 5
+ ⇒ 5
(-sort (-flip '<) '(4 3 6 1))
- => '(6 4 3 1)
+ ⇒ '(6 4 3 1)
-- Function: -const (c)
- Return a function that returns C ignoring any additional
- arguments.
+ Return a function that returns C ignoring any additional arguments.
In types: a -> b -> a
(funcall (-const 2) 1 3 "foo")
- => 2
+ ⇒ 2
(-map (-const 1) '("a" "b" "c" "d"))
- => '(1 1 1 1)
+ ⇒ '(1 1 1 1)
(-sum (-map (-const 1) '("a" "b" "c" "d")))
- => 4
+ ⇒ 4
- -- Function: -cut (&rest params)
+ -- Macro: -cut (&rest params)
Take n-ary function and n arguments and specialize some of them.
Arguments denoted by <> will be left unspecialized.
See SRFI-26 for detailed description.
(funcall (-cut list 1 <> 3 <> 5) 2 4)
- => '(1 2 3 4 5)
+ ⇒ '(1 2 3 4 5)
(-map (-cut funcall <> 5) '(1+ 1- (lambda (x) (/ 1.0 x))))
- => '(6 4 0.2)
+ ⇒ '(6 4 0.2)
(-filter (-cut < <> 5) '(1 3 5 7 9))
- => '(1 3)
+ ⇒ '(1 3)
-- Function: -not (pred)
- Take an unary predicates PRED and return an unary predicate that
+ Take a unary predicate PRED and return a unary predicate that
returns t if PRED returns nil and nil if PRED returns non-nil.
(funcall (-not 'even?) 5)
- => t
+ ⇒ t
(-filter (-not (-partial '< 4)) '(1 2 3 4 5 6 7 8))
- => '(1 2 3 4)
+ ⇒ '(1 2 3 4)
-- Function: -orfn (&rest preds)
- Take list of unary predicates PREDS and return an unary
- predicate with argument x that returns non-nil if at least one of
- the PREDS returns non-nil on x.
+ Take list of unary predicates PREDS and return a unary predicate
+ with argument x that returns non-nil if at least one of the PREDS
+ returns non-nil on x.
In types: [a -> Bool] -> a -> Bool
(-filter (-orfn 'even? (-partial (-flip '<) 5)) '(1 2 3 4 5 6 7 8 9
10))
- => '(1 2 3 4 6 8 10)
+ ⇒ '(1 2 3 4 6 8 10)
(funcall (-orfn 'stringp 'even?) "foo")
- => t
+ ⇒ t
-- Function: -andfn (&rest preds)
- Take list of unary predicates PREDS and return an unary
- predicate with argument x that returns non-nil if all of the
- PREDS returns non-nil on x.
+ Take list of unary predicates PREDS and return a unary predicate
+ with argument x that returns non-nil if all of the PREDS returns
+ non-nil on x.
In types: [a -> Bool] -> a -> Bool
(funcall (-andfn (-cut < <> 10) 'even?) 6)
- => t
+ ⇒ t
(funcall (-andfn (-cut < <> 10) 'even?) 12)
- => nil
+ ⇒ nil
(-filter (-andfn (-not 'even?) (-cut >= 5 <>)) '(1 2 3 4 5 6 7 8 9
10))
- => '(1 3 5)
+ ⇒ '(1 3 5)
-- Function: -iteratefn (fn n)
Return a function FN composed N times with itself.
FN is a unary function. If you need to use a function of higher
- arity, use `-applify' (*note -applify::) first to turn it into
- an unary function.
+ arity, use ‘-applify’ (*note -applify::) first to turn it into a
+ unary function.
With n = 0, this acts as identity function.
@@ -2250,70 +2328,68 @@ offered in a separate package: `dash-functional`.
(1+ n))).
(funcall (-iteratefn (lambda (x) (* x x)) 3) 2)
- => 256
+ ⇒ 256
(funcall (-iteratefn '1+ 3) 1)
- => 4
+ ⇒ 4
(funcall (-iteratefn 'cdr 3) '(1 2 3 4 5))
- => '(4 5)
+ ⇒ '(4 5)
-- Function: -fixfn (fn &optional equal-test halt-test)
Return a function that computes the (least) fixpoint of FN.
- FN must be a unary function. The returned lambda takes a single
- argument, X, the initial value for the fixpoint iteration. The
+ FN must be a unary function. The returned lambda takes a single
+ argument, X, the initial value for the fixpoint iteration. The
iteration halts when either of the following conditions is
satisified:
- 1. Iteration converges to the fixpoint, with equality being
- tested using EQUAL-TEST. If EQUAL-TEST is not specified,
- `equal' is used. For functions over the floating point
- numbers, it may be necessary to provide an appropriate
- appoximate comparsion test.
+ 1. Iteration converges to the fixpoint, with equality being tested
+ using EQUAL-TEST. If EQUAL-TEST is not specified, ‘equal’ is used.
+ For functions over the floating point numbers, it may be necessary
+ to provide an appropriate appoximate comparsion test.
- 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.
+ 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.
The return value of the lambda is either the fixpoint or, if
- iteration halted before converging, a cons with car `halted' and
+ iteration halted before converging, a cons with car ‘halted’ and
cdr the final output from HALT-TEST.
In types: (a -> a) -> a -> a.
(funcall (-fixfn 'cos 'approx-equal) 0.7)
- => 0.7390851332151607
+ ⇒ 0.7390851332151607
(funcall (-fixfn (lambda (x) (expt (+ x 10) 0.25))) 2.0)
- => 1.8555845286409378
+ ⇒ 1.8555845286409378
(funcall (-fixfn 'sin 'approx-equal) 0.1)
- => '(halted . t)
+ ⇒ '(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.
+ 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.
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))
(funcall (-prodfn '1+ '1- 'int-to-string) '(1 2 3))
- => '(2 1 "3")
+ ⇒ '(2 1 "3")
(-map (-prodfn '1+ '1-) '((1 2) (3 4) (5 6) (7 8)))
- => '((2 1) (4 3) (6 5) (8 7))
+ ⇒ '((2 1) (4 3) (6 5) (8 7))
(apply '+ (funcall (-prodfn 'length 'string-to-int) '((1 2 3) "15")))
- => 18
+ ⇒ 18
File: dash.info, Node: Development, Next: Index, Prev: Functions, Up: Top
@@ -2322,7 +2398,7 @@ File: dash.info, Node: Development, Next: Index, Prev:
Functions, Up: Top
*************
The dash repository is hosted on GitHub:
-`https://github.com/magnars/dash.el'
+<https://github.com/magnars/dash.el>
* Menu:
@@ -2336,21 +2412,20 @@ File: dash.info, Node: Contribute, Next: Changes,
Up: Development
3.1 Contribute
==============
-Yes, please do. Pure functions in the list manipulation realm only,
-please. There's a suite of tests in dev/examples.el, so remember to
-add tests for your function, or it might get broken later.
+Yes, please do. Pure functions in the list manipulation realm only,
+please. There’s a suite of tests in dev/examples.el, so remember to add
+tests for your function, or it might get broken later.
- Run the tests with `./run-tests.sh'. Create the docs with
-`./create-docs.sh'. I highly recommend that you install these as a
+ Run the tests with ‘./run-tests.sh’. Create the docs with
+‘./create-docs.sh’. I highly recommend that you install these as a
pre-commit hook, so that the tests are always running and the docs are
always in sync:
-
cp pre-commit.sh .git/hooks/pre-commit
- Oh, and don't edit `README.md' directly, it is auto-generated.
-Change `readme-template.md' or `examples-to-docs.el' instead. The
-same goes for the info manual.
+ Oh, and don’t edit ‘README.md’ directly, it is auto-generated.
+Change ‘readme-template.md’ or ‘examples-to-docs.el’ instead. The same
+goes for the info manual.
File: dash.info, Node: Changes, Next: Contributors, Prev: Contribute, Up:
Development
@@ -2360,135 +2435,107 @@ File: dash.info, Node: Changes, Next: Contributors,
Prev: Contribute, Up: De
Changes in 2.10:
- * Add `-let' destructuring to `-if-let' and `-when-let' (Fredrik
+ • Add ‘-let’ destructuring to ‘-if-let’ and ‘-when-let’ (Fredrik
Bergroth)
Changes in 2.9:
- * Add `-let', `-let*' and `-lambda' with destructuring
-
- * Add `-tree-seq' and `-tree-map-nodes'
-
- * Add `-non-nil'
-
- * Add `-fix'
-
- * Add `-fixfn' (dash-functional 1.2)
-
- * Add `-copy' (Wilfred Hughes)
+ • Add ‘-let’, ‘-let*’ and ‘-lambda’ with destructuring
+ • Add ‘-tree-seq’ and ‘-tree-map-nodes’
+ • Add ‘-non-nil’
+ • Add ‘-fix’
+ • Add ‘-fixfn’ (dash-functional 1.2)
+ • Add ‘-copy’ (Wilfred Hughes)
Changes in 2.8:
- * Add `-butlast'
+ • Add ‘-butlast’
Changes in 2.7:
- * `-zip' now supports more than two lists (Steve Lamb)
-
- * Add `-cycle', `-pad', `-annotate', `-zip-fill' (Steve Lamb)
-
- * Add `-table', `-table-flat' (finite cartesian product)
-
- * Add `-flatten-n'
-
- * `-slice' now supports "step" argument
-
- * Add functional combinators `-iteratefn', `-prodfn'
-
- * Add `-replace', `-splice', `-splice-list' which generalize
- `-replace-at' and `-insert-at'
-
- * Add `-compose', `-iteratefn' and `-prodfn' (dash-functional 1.1)
+ • ‘-zip’ now supports more than two lists (Steve Lamb)
+ • Add ‘-cycle’, ‘-pad’, ‘-annotate’, ‘-zip-fill’ (Steve Lamb)
+ • Add ‘-table’, ‘-table-flat’ (finite cartesian product)
+ • Add ‘-flatten-n’
+ • ‘-slice’ now supports "step" argument
+ • Add functional combinators ‘-iteratefn’, ‘-prodfn’
+ • Add ‘-replace’, ‘-splice’, ‘-splice-list’ which generalize
+ ‘-replace-at’ and ‘-insert-at’
+ • Add ‘-compose’, ‘-iteratefn’ and ‘-prodfn’ (dash-functional 1.1)
Changes in 2.6:
- * Add `-is-prefix-p', `-is-suffix-p', `-is-infix-p' (Matus Goljer)
-
- * Add `-iterate', `-unfold' (Matus Goljer)
-
- * Add `-split-on', `-split-when' (Matus Goljer)
-
- * Add `-find-last-index' (Matus Goljer)
-
- * Add `-list' (Johan Andersson)
+ • Add ‘-is-prefix-p’, ‘-is-suffix-p’, ‘-is-infix-p’ (Matus Goljer)
+ • Add ‘-iterate’, ‘-unfold’ (Matus Goljer)
+ • Add ‘-split-on’, ‘-split-when’ (Matus Goljer)
+ • Add ‘-find-last-index’ (Matus Goljer)
+ • Add ‘-list’ (Johan Andersson)
Changes in 2.5:
- * Add `-same-items?' (Johan Andersson)
-
- * A few bugfixes
+ • Add ‘-same-items?’ (Johan Andersson)
+ • A few bugfixes
Changes in 2.4:
- * Add `-snoc' (Matus Goljer)
-
- * Add `-replace-at', `-update-at', `-remove-at', and
- `-remove-at-indices' (Matus Goljer)
+ • Add ‘-snoc’ (Matus Goljer)
+ • Add ‘-replace-at’, ‘-update-at’, ‘-remove-at’, and
+ ‘-remove-at-indices’ (Matus Goljer)
Changes in 2.3:
- * Add tree operations (Matus Goljer)
-
- * Make font-lock optional
+ • Add tree operations (Matus Goljer)
+ • Make font-lock optional
Changes in 2.2:
- * Add `-compose' (Christina Whyte)
+ • Add ‘-compose’ (Christina Whyte)
Changes in 2.1:
- * Add indexing operations (Matus Goljer)
+ • Add indexing operations (Matus Goljer)
Changes in 2.0:
- * Split out `dash-functional.el' (Matus Goljer)
-
- * Add `-andfn', `-orfn', `-not', `-cut', `-const', `-flip' and
- `-on'. (Matus Goljer)
-
- * Fix `-min', `-max', `-min-by' and `-max-by' (Matus Goljer)
+ • Split out ‘dash-functional.el’ (Matus Goljer)
+ • Add ‘-andfn’, ‘-orfn’, ‘-not’, ‘-cut’, ‘-const’, ‘-flip’ and ‘-on’.
+ (Matus Goljer)
+ • Fix ‘-min’, ‘-max’, ‘-min-by’ and ‘-max-by’ (Matus Goljer)
Changes in 1.8:
- * Add `-first-item' and `-last-item' (Wilfred Hughes)
+ • Add ‘-first-item’ and ‘-last-item’ (Wilfred Hughes)
Changes in 1.7:
- * Add `-rotate' (Matus Goljer)
+ • Add ‘-rotate’ (Matus Goljer)
Changes in 1.6:
- * Add `-min', `-max', `-min-by' and `-max-by' (Johan Andersson)
+ • Add ‘-min’, ‘-max’, ‘-min-by’ and ‘-max-by’ (Johan Andersson)
Changes in 1.5:
- * Add `-sum' and `-product' (Johan Andersson)
+ • Add ‘-sum’ and ‘-product’ (Johan Andersson)
Changes in 1.4:
- * Add `-sort'
-
- * Add `-reduce-r' (Matus Goljer)
-
- * Add `-reduce-r-from' (Matus Goljer)
+ • Add ‘-sort’
+ • Add ‘-reduce-r’ (Matus Goljer)
+ • Add ‘-reduce-r-from’ (Matus Goljer)
Changes in 1.3:
- * Add `-partition-in-steps'
-
- * Add `-partition-all-in-steps'
+ • Add ‘-partition-in-steps’
+ • Add ‘-partition-all-in-steps’
Changes in 1.2:
- * Add `-last' (Matus Goljer)
-
- * Add `-insert-at' (Emanuel Evans)
-
- * Add `-when-let' and `-if-let' (Emanuel Evans)
-
- * Add `-when-let*' and `-if-let*' (Emanuel Evans)
-
- * Some bugfixes
+ • Add ‘-last’ (Matus Goljer)
+ • Add ‘-insert-at’ (Emanuel Evans)
+ • Add ‘-when-let’ and ‘-if-let’ (Emanuel Evans)
+ • Add ‘-when-let*’ and ‘-if-let*’ (Emanuel Evans)
+ • Some bugfixes
File: dash.info, Node: Contributors, Prev: Changes, Up: Development
@@ -2496,46 +2543,31 @@ File: dash.info, Node: Contributors, Prev: Changes,
Up: Development
3.3 Contributors
================
- * Matus Goljer (https://github.com/Fuco1) contributed lots of
+ • Matus Goljer (https://github.com/Fuco1) contributed lots of
features and functions.
-
- * Takafumi Arakaki (https://github.com/tkf) contributed
- `-group-by'.
-
- * tali713 (https://github.com/tali713) is the author of `-applify'.
-
- * Víctor M. Valenzuela (https://github.com/vemv) contributed
- `-repeat'.
-
- * Nic Ferrier (https://github.com/nicferrier) contributed `-cons*'.
-
- * Wilfred Hughes (https://github.com/Wilfred) contributed
- `-slice', `-first-item' and `-last-item'.
-
- * Emanuel Evans (https://github.com/shosti) contributed `-if-let',
- `-when-let' and `-insert-at'.
-
- * Johan Andersson (https://github.com/rejeep) contributed `-sum',
- `-product' and `-same-items?'
-
- * Christina Whyte (https://github.com/kurisuwhyte) contributed
- `-compose'
-
- * Steve Lamb (https://github.com/steventlamb) contributed
- `-cycle', `-pad', `-annotate', `-zip-fill' and an n-ary version
- of `-zip'.
-
- * Fredrik Bergroth (https://github.com/fbergroth) made the
- `-if-let' family use `-let' destructuring and improved script
- for generating documentation.
-
- * Mark Oteiza (https://github.com/holomorph) contributed the
- script to create an info manual.
-
- * Vasilij Schneidermann (https://github.com/wasamasa) contributed
- `-some'.
-
- * William West (https://github.com/occidens) made `-fixfn' more
+ • Takafumi Arakaki (https://github.com/tkf) contributed ‘-group-by’.
+ • tali713 (https://github.com/tali713) is the author of ‘-applify’.
+ • Víctor M. Valenzuela (https://github.com/vemv) contributed
+ ‘-repeat’.
+ • Nic Ferrier (https://github.com/nicferrier) contributed ‘-cons*’.
+ • Wilfred Hughes (https://github.com/Wilfred) contributed ‘-slice’,
+ ‘-first-item’ and ‘-last-item’.
+ • Emanuel Evans (https://github.com/shosti) contributed ‘-if-let’,
+ ‘-when-let’ and ‘-insert-at’.
+ • Johan Andersson (https://github.com/rejeep) contributed ‘-sum’,
+ ‘-product’ and ‘-same-items?’
+ • Christina Whyte (https://github.com/kurisuwhyte) contributed
+ ‘-compose’
+ • Steve Lamb (https://github.com/steventlamb) contributed ‘-cycle’,
+ ‘-pad’, ‘-annotate’, ‘-zip-fill’ and an n-ary version of ‘-zip’.
+ • Fredrik Bergroth (https://github.com/fbergroth) made the ‘-if-let’
+ family use ‘-let’ destructuring and improved script for generating
+ documentation.
+ • Mark Oteiza (https://github.com/holomorph) contributed the script
+ to create an info manual.
+ • Vasilij Schneidermann (https://github.com/wasamasa) contributed
+ ‘-some’.
+ • William West (https://github.com/occidens) made ‘-fixfn’ more
robust at handling floats.
Thanks!
@@ -2550,357 +2582,374 @@ Index
* Menu:
* !cdr: Destructive operations.
- (line 15)
+ (line 14)
* !cons: Destructive operations.
- (line 7)
-* -->: Threading macros. (line 33)
-* ->: Threading macros. (line 7)
-* ->>: Threading macros. (line 20)
-* -all?: Predicates. (line 19)
+ (line 6)
+* -->: Threading macros. (line 32)
+* ->: Threading macros. (line 6)
+* ->>: Threading macros. (line 19)
+* -all?: Predicates. (line 18)
* -andfn: Function combinators.
- (line 141)
-* -annotate: Maps. (line 79)
-* -any?: Predicates. (line 7)
+ (line 138)
+* -annotate: Maps. (line 80)
+* -any?: Predicates. (line 6)
* -applify: Function combinators.
- (line 57)
+ (line 55)
* -butlast: Other list operations.
- (line 238)
-* -clone: Tree operations. (line 124)
+ (line 241)
+* -clone: Tree operations. (line 122)
* -compose: Function combinators.
- (line 43)
-* -concat: List to list. (line 23)
+ (line 42)
+* -concat: List to list. (line 22)
* -cons*: Other list operations.
- (line 29)
+ (line 28)
* -const: Function combinators.
- (line 94)
-* -contains?: Predicates. (line 58)
-* -copy: Maps. (line 134)
-* -count: Reductions. (line 91)
+ (line 92)
+* -contains?: Predicates. (line 57)
+* -copy: Maps. (line 135)
+* -count: Reductions. (line 89)
* -cut: Function combinators.
- (line 107)
+ (line 104)
* -cycle: Other list operations.
- (line 119)
-* -difference: Set operations. (line 21)
-* -distinct: Set operations. (line 45)
-* -dotimes: Side-effects. (line 29)
-* -drop: Sublist selection. (line 108)
-* -drop-while: Sublist selection. (line 127)
-* -each: Side-effects. (line 9)
-* -each-while: Side-effects. (line 20)
-* -elem-index: Indexing. (line 10)
-* -elem-indices: Indexing. (line 22)
-* -filter: Sublist selection. (line 9)
-* -find-index: Indexing. (line 33)
-* -find-indices: Indexing. (line 57)
-* -find-last-index: Indexing. (line 45)
+ (line 122)
+* -difference: Set operations. (line 20)
+* -distinct: Set operations. (line 44)
+* -dotimes: Side-effects. (line 41)
+* -doto: Side-effects. (line 50)
+* -drop: Sublist selection. (line 122)
+* -drop-last: Sublist selection. (line 132)
+* -drop-while: Sublist selection. (line 153)
+* -each: Side-effects. (line 8)
+* -each-indexed: Side-effects. (line 28)
+* -each-while: Side-effects. (line 19)
+* -elem-index: Indexing. (line 9)
+* -elem-indices: Indexing. (line 21)
+* -filter: Sublist selection. (line 8)
+* -find-index: Indexing. (line 32)
+* -find-indices: Indexing. (line 60)
+* -find-last-index: Indexing. (line 46)
* -first: Other list operations.
- (line 185)
+ (line 188)
* -first-item: Other list operations.
- (line 222)
+ (line 225)
* -fix: Other list operations.
- (line 275)
+ (line 277)
* -fixfn: Function combinators.
- (line 178)
-* -flatten: List to list. (line 34)
-* -flatten-n: List to list. (line 56)
+ (line 175)
+* -flatten: List to list. (line 33)
+* -flatten-n: List to list. (line 55)
* -flip: Function combinators.
- (line 82)
-* -grade-down: Indexing. (line 78)
-* -grade-up: Indexing. (line 68)
-* -group-by: Partitioning. (line 146)
-* -if-let: Binding. (line 37)
-* -if-let*: Binding. (line 48)
-* -insert-at: List to list. (line 110)
+ (line 80)
+* -grade-down: Indexing. (line 81)
+* -grade-up: Indexing. (line 71)
+* -group-by: Partitioning. (line 145)
+* -if-let: Binding. (line 35)
+* -if-let*: Binding. (line 46)
+* -insert-at: List to list. (line 109)
* -interleave: Other list operations.
- (line 67)
+ (line 66)
* -interpose: Other list operations.
- (line 57)
-* -intersection: Set operations. (line 33)
-* -is-infix?: Predicates. (line 111)
-* -is-prefix?: Predicates. (line 87)
-* -is-suffix?: Predicates. (line 99)
-* -iterate: Unfolding. (line 10)
+ (line 56)
+* -intersection: Set operations. (line 32)
+* -is-infix?: Predicates. (line 110)
+* -is-prefix?: Predicates. (line 86)
+* -is-suffix?: Predicates. (line 98)
+* -iterate: Unfolding. (line 9)
* -iteratefn: Function combinators.
- (line 155)
+ (line 152)
* -juxt: Function combinators.
- (line 32)
-* -keep: List to list. (line 9)
-* -lambda: Binding. (line 224)
+ (line 31)
+* -keep: List to list. (line 8)
+* -lambda: Binding. (line 216)
* -last: Other list operations.
- (line 212)
+ (line 215)
* -last-item: Other list operations.
- (line 230)
-* -let: Binding. (line 64)
-* -let*: Binding. (line 204)
+ (line 233)
+* -let: Binding. (line 62)
+* -let*: Binding. (line 196)
* -list: Other list operations.
- (line 262)
-* -map: Maps. (line 11)
-* -map-first: Maps. (line 39)
-* -map-indexed: Maps. (line 67)
-* -map-last: Maps. (line 53)
-* -map-when: Maps. (line 22)
-* -mapcat: Maps. (line 123)
-* -max: Reductions. (line 143)
-* -max-by: Reductions. (line 153)
-* -min: Reductions. (line 119)
-* -min-by: Reductions. (line 129)
-* -non-nil: Sublist selection. (line 77)
-* -none?: Predicates. (line 31)
+ (line 264)
+* -map: Maps. (line 10)
+* -map-first: Maps. (line 38)
+* -map-indexed: Maps. (line 66)
+* -map-last: Maps. (line 52)
+* -map-when: Maps. (line 21)
+* -mapcat: Maps. (line 124)
+* -max: Reductions. (line 141)
+* -max-by: Reductions. (line 151)
+* -min: Reductions. (line 117)
+* -min-by: Reductions. (line 127)
+* -non-nil: Sublist selection. (line 77)
+* -none?: Predicates. (line 30)
* -not: Function combinators.
- (line 120)
+ (line 117)
* -on: Function combinators.
- (line 68)
-* -only-some?: Predicates. (line 43)
+ (line 66)
+* -only-some?: Predicates. (line 42)
* -orfn: Function combinators.
- (line 129)
+ (line 126)
* -pad: Other list operations.
- (line 130)
+ (line 133)
* -partial: Function combinators.
- (line 10)
-* -partition: Partitioning. (line 75)
-* -partition-all: Partitioning. (line 87)
-* -partition-all-in-steps: Partitioning. (line 110)
-* -partition-by: Partitioning. (line 122)
-* -partition-by-header: Partitioning. (line 133)
-* -partition-in-steps: Partitioning. (line 98)
+ (line 9)
+* -partition: Partitioning. (line 74)
+* -partition-all: Partitioning. (line 86)
+* -partition-all-in-steps: Partitioning. (line 109)
+* -partition-by: Partitioning. (line 121)
+* -partition-by-header: Partitioning. (line 132)
+* -partition-in-steps: Partitioning. (line 97)
* -prodfn: Function combinators.
- (line 213)
-* -product: Reductions. (line 109)
-* -reduce: Reductions. (line 47)
-* -reduce-from: Reductions. (line 9)
-* -reduce-r: Reductions. (line 67)
-* -reduce-r-from: Reductions. (line 28)
-* -remove: Sublist selection. (line 22)
-* -remove-at: List to list. (line 147)
-* -remove-at-indices: List to list. (line 160)
-* -remove-first: Sublist selection. (line 35)
-* -remove-item: Sublist selection. (line 65)
-* -remove-last: Sublist selection. (line 50)
+ (line 209)
+* -product: Reductions. (line 107)
+* -reduce: Reductions. (line 46)
+* -reduce-from: Reductions. (line 8)
+* -reduce-r: Reductions. (line 66)
+* -reduce-r-from: Reductions. (line 27)
+* -remove: Sublist selection. (line 23)
+* -remove-at: List to list. (line 145)
+* -remove-at-indices: List to list. (line 158)
+* -remove-first: Sublist selection. (line 35)
+* -remove-item: Sublist selection. (line 65)
+* -remove-last: Sublist selection. (line 50)
* -repeat: Other list operations.
- (line 18)
-* -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)
+ (line 17)
+* -replace: List to list. (line 67)
+* -replace-at: List to list. (line 120)
+* -replace-first: List to list. (line 81)
+* -replace-last: List to list. (line 95)
* -rotate: Other list operations.
- (line 9)
+ (line 8)
* -rpartial: Function combinators.
- (line 21)
-* -same-items?: Predicates. (line 73)
-* -select-by-indices: Sublist selection. (line 138)
-* -separate: Partitioning. (line 64)
-* -slice: Sublist selection. (line 83)
+ (line 20)
+* -same-items?: Predicates. (line 72)
+* -select-by-indices: Sublist selection. (line 164)
+* -select-column: Sublist selection. (line 194)
+* -select-columns: Sublist selection. (line 175)
+* -separate: Partitioning. (line 63)
+* -slice: Sublist selection. (line 83)
* -snoc: Other list operations.
- (line 43)
+ (line 42)
* -some: Other list operations.
- (line 199)
-* -some-->: Threading macros. (line 70)
-* -some->: Threading macros. (line 46)
-* -some->>: Threading macros. (line 58)
+ (line 202)
+* -some-->: Threading macros. (line 69)
+* -some->: Threading macros. (line 45)
+* -some->>: Threading macros. (line 57)
* -sort: Other list operations.
- (line 248)
-* -splice: Maps. (line 90)
-* -splice-list: Maps. (line 110)
-* -split-at: Partitioning. (line 9)
-* -split-on: Partitioning. (line 29)
-* -split-when: Partitioning. (line 47)
-* -split-with: Partitioning. (line 18)
-* -sum: Reductions. (line 99)
+ (line 251)
+* -splice: Maps. (line 91)
+* -splice-list: Maps. (line 111)
+* -split-at: Partitioning. (line 8)
+* -split-on: Partitioning. (line 28)
+* -split-when: Partitioning. (line 46)
+* -split-with: Partitioning. (line 17)
+* -sum: Reductions. (line 97)
* -table: Other list operations.
- (line 141)
+ (line 144)
* -table-flat: Other list operations.
- (line 160)
-* -take: Sublist selection. (line 99)
-* -take-while: Sublist selection. (line 116)
-* -tree-map: Tree operations. (line 29)
-* -tree-map-nodes: Tree operations. (line 40)
-* -tree-mapreduce: Tree operations. (line 86)
-* -tree-mapreduce-from: Tree operations. (line 105)
-* -tree-reduce: Tree operations. (line 54)
-* -tree-reduce-from: Tree operations. (line 71)
-* -tree-seq: Tree operations. (line 9)
-* -unfold: Unfolding. (line 26)
-* -union: Set operations. (line 9)
-* -update-at: List to list. (line 134)
-* -when-let: Binding. (line 10)
-* -when-let*: Binding. (line 23)
+ (line 163)
+* -take: Sublist selection. (line 99)
+* -take-last: Sublist selection. (line 110)
+* -take-while: Sublist selection. (line 142)
+* -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-seq: Tree operations. (line 8)
+* -unfold: Unfolding. (line 25)
+* -union: Set operations. (line 8)
+* -update-at: List to list. (line 132)
+* -when-let: Binding. (line 9)
+* -when-let*: Binding. (line 22)
* -zip: Other list operations.
- (line 94)
+ (line 93)
* -zip-fill: Other list operations.
- (line 111)
+ (line 114)
* -zip-with: Other list operations.
- (line 78)
+ (line 77)
Tag Table:
-Node: Top965
-Node: Installation2459
-Node: Using in a package3028
-Node: Syntax highlighting of dash functions3392
-Node: Functions3776
-Node: Maps4977
-Ref: -map5273
-Ref: -map-when5611
-Ref: -map-first6185
-Ref: -map-last6652
-Ref: -map-indexed7115
-Ref: -annotate7517
-Ref: -splice8004
-Ref: -splice-list8770
-Ref: -mapcat9221
-Ref: -copy9594
-Node: Sublist selection9780
-Ref: -filter9973
-Ref: -remove10340
-Ref: -remove-first10695
-Ref: -remove-last11207
-Ref: -remove-item11713
-Ref: -non-nil12100
-Ref: -slice12258
-Ref: -take12787
-Ref: -drop13039
-Ref: -take-while13238
-Ref: -drop-while13585
-Ref: -select-by-indices13938
-Node: List to list14445
-Ref: -keep14632
-Ref: -concat15128
-Ref: -flatten15422
-Ref: -flatten-n16164
-Ref: -replace16544
-Ref: -replace-first16996
-Ref: -replace-last17481
-Ref: -insert-at17959
-Ref: -replace-at18276
-Ref: -update-at18664
-Ref: -remove-at19144
-Ref: -remove-at-indices19621
-Node: Reductions20188
-Ref: -reduce-from20357
-Ref: -reduce-r-from21116
-Ref: -reduce21885
-Ref: -reduce-r22665
-Ref: -count23569
-Ref: -sum23791
-Ref: -product23977
-Ref: -min24183
-Ref: -min-by24406
-Ref: -max24922
-Ref: -max-by25144
-Node: Unfolding25665
-Ref: -iterate25904
-Ref: -unfold26346
-Node: Predicates27137
-Ref: -any?27261
-Ref: -all?27574
-Ref: -none?27889
-Ref: -only-some?28184
-Ref: -contains?28654
-Ref: -same-items?29026
-Ref: -is-prefix?29404
-Ref: -is-suffix?29720
-Ref: -is-infix?30036
-Node: Partitioning30383
-Ref: -split-at30571
-Ref: -split-with30854
-Ref: -split-on31254
-Ref: -split-when31918
-Ref: -separate32547
-Ref: -partition32986
-Ref: -partition-all33435
-Ref: -partition-in-steps33860
-Ref: -partition-all-in-steps34354
-Ref: -partition-by34836
-Ref: -partition-by-header35215
-Ref: -group-by35815
-Node: Indexing36245
-Ref: -elem-index36447
-Ref: -elem-indices36839
-Ref: -find-index37219
-Ref: -find-last-index37659
-Ref: -find-indices38116
-Ref: -grade-up38521
-Ref: -grade-down38922
-Node: Set operations39330
-Ref: -union39513
-Ref: -difference39944
-Ref: -intersection40348
-Ref: -distinct40772
-Node: Other list operations41080
-Ref: -rotate41305
-Ref: -repeat41598
-Ref: -cons*41858
-Ref: -snoc42242
-Ref: -interpose42648
-Ref: -interleave42943
-Ref: -zip-with43309
-Ref: -zip43997
-Ref: -zip-fill44644
-Ref: -cycle44965
-Ref: -pad45335
-Ref: -table45655
-Ref: -table-flat46438
-Ref: -first47427
-Ref: -some47790
-Ref: -last48153
-Ref: -first-item48484
-Ref: -last-item48681
-Ref: -butlast48874
-Ref: -sort49118
-Ref: -list49608
-Ref: -fix49936
-Node: Tree operations50470
-Ref: -tree-seq50666
-Ref: -tree-map51521
-Ref: -tree-map-nodes51961
-Ref: -tree-reduce52813
-Ref: -tree-reduce-from53688
-Ref: -tree-mapreduce54287
-Ref: -tree-mapreduce-from55131
-Ref: -clone56401
-Node: Threading macros56728
-Ref: ->56873
-Ref: ->>57363
-Ref: -->57867
-Ref: -some->58382
-Ref: -some->>58752
-Ref: -some-->59184
-Node: Binding59650
-Ref: -when-let59854
-Ref: -when-let*60344
-Ref: -if-let60867
-Ref: -if-let*61258
-Ref: -let61869
-Ref: -let*66973
-Ref: -lambda67910
-Node: Side-effects68707
-Ref: -each68901
-Ref: -each-while69304
-Ref: -dotimes69662
-Node: Destructive operations69963
-Ref: !cons70136
-Ref: !cdr70343
-Node: Function combinators70539
-Ref: -partial70808
-Ref: -rpartial71201
-Ref: -juxt71601
-Ref: -compose72030
-Ref: -applify72584
-Ref: -on73028
-Ref: -flip73548
-Ref: -const73857
-Ref: -cut74198
-Ref: -not74651
-Ref: -orfn74962
-Ref: -andfn75395
-Ref: -iteratefn75888
-Ref: -fixfn76585
-Ref: -prodfn78140
-Node: Development79187
-Node: Contribute79536
-Node: Changes80257
-Node: Contributors82871
-Node: Index84393
+Node: Top946
+Node: Installation2425
+Node: Using in a package3001
+Node: Syntax highlighting of dash functions3365
+Node: Functions3749
+Node: Maps4960
+Ref: -map5255
+Ref: -map-when5596
+Ref: -map-first6181
+Ref: -map-last6659
+Ref: -map-indexed7133
+Ref: -annotate7606
+Ref: -splice8096
+Ref: -splice-list8877
+Ref: -mapcat9339
+Ref: -copy9715
+Node: Sublist selection9903
+Ref: -filter10096
+Ref: -remove10514
+Ref: -remove-first10871
+Ref: -remove-last11398
+Ref: -remove-item11919
+Ref: -non-nil12313
+Ref: -slice12472
+Ref: -take13004
+Ref: -take-last13312
+Ref: -drop13635
+Ref: -drop-last13890
+Ref: -take-while14150
+Ref: -drop-while14500
+Ref: -select-by-indices14856
+Ref: -select-columns15370
+Ref: -select-column16076
+Node: List to list16540
+Ref: -keep16727
+Ref: -concat17230
+Ref: -flatten17527
+Ref: -flatten-n18286
+Ref: -replace18673
+Ref: -replace-first19136
+Ref: -replace-last19632
+Ref: -insert-at20121
+Ref: -replace-at20448
+Ref: -update-at20838
+Ref: -remove-at21329
+Ref: -remove-at-indices21817
+Node: Reductions22399
+Ref: -reduce-from22568
+Ref: -reduce-r-from23347
+Ref: -reduce24132
+Ref: -reduce-r24933
+Ref: -count25850
+Ref: -sum26074
+Ref: -product26263
+Ref: -min26472
+Ref: -min-by26698
+Ref: -max27221
+Ref: -max-by27446
+Node: Unfolding27974
+Ref: -iterate28213
+Ref: -unfold28658
+Node: Predicates29466
+Ref: -any?29590
+Ref: -all?29918
+Ref: -none?30248
+Ref: -only-some?30550
+Ref: -contains?31035
+Ref: -same-items?31424
+Ref: -is-prefix?31809
+Ref: -is-suffix?32132
+Ref: -is-infix?32455
+Node: Partitioning32809
+Ref: -split-at32997
+Ref: -split-with33282
+Ref: -split-on33685
+Ref: -split-when34361
+Ref: -separate35001
+Ref: -partition35443
+Ref: -partition-all35895
+Ref: -partition-in-steps36323
+Ref: -partition-all-in-steps36820
+Ref: -partition-by37305
+Ref: -partition-by-header37687
+Ref: -group-by38291
+Node: Indexing38728
+Ref: -elem-index38930
+Ref: -elem-indices39325
+Ref: -find-index39708
+Ref: -find-last-index40197
+Ref: -find-indices40701
+Ref: -grade-up41109
+Ref: -grade-down41512
+Node: Set operations41922
+Ref: -union42105
+Ref: -difference42547
+Ref: -intersection42964
+Ref: -distinct43401
+Node: Other list operations43725
+Ref: -rotate43950
+Ref: -repeat44245
+Ref: -cons*44508
+Ref: -snoc44895
+Ref: -interpose45308
+Ref: -interleave45606
+Ref: -zip-with45975
+Ref: -zip46678
+Ref: -zip-fill47484
+Ref: -cycle47807
+Ref: -pad48180
+Ref: -table48503
+Ref: -table-flat49292
+Ref: -first50291
+Ref: -some50665
+Ref: -last51035
+Ref: -first-item51369
+Ref: -last-item51568
+Ref: -butlast51763
+Ref: -sort52010
+Ref: -list52499
+Ref: -fix52830
+Node: Tree operations53370
+Ref: -tree-seq53566
+Ref: -tree-map54424
+Ref: -tree-map-nodes54867
+Ref: -tree-reduce55717
+Ref: -tree-reduce-from56599
+Ref: -tree-mapreduce57200
+Ref: -tree-mapreduce-from58060
+Ref: -clone59346
+Node: Threading macros59674
+Ref: ->59819
+Ref: ->>60310
+Ref: -->60815
+Ref: -some->61341
+Ref: -some->>61715
+Ref: -some-->62151
+Node: Binding62622
+Ref: -when-let62834
+Ref: -when-let*63328
+Ref: -if-let63851
+Ref: -if-let*64246
+Ref: -let64863
+Ref: -let*69658
+Ref: -lambda70598
+Node: Side-effects71395
+Ref: -each71589
+Ref: -each-while71996
+Ref: -each-indexed72356
+Ref: -dotimes72867
+Ref: -doto73170
+Node: Destructive operations73598
+Ref: !cons73771
+Ref: !cdr73977
+Node: Function combinators74172
+Ref: -partial74446
+Ref: -rpartial74842
+Ref: -juxt75245
+Ref: -compose75677
+Ref: -applify76230
+Ref: -on76677
+Ref: -flip77200
+Ref: -const77512
+Ref: -cut77851
+Ref: -not78304
+Ref: -orfn78614
+Ref: -andfn79048
+Ref: -iteratefn79543
+Ref: -fixfn80246
+Ref: -prodfn81809
+Node: Development82871
+Node: Contribute83220
+Node: Changes83968
+Node: Contributors86966
+Node: Index88585
End Tag Table
+
+
+Local Variables:
+coding: utf-8
+End:
diff --git a/dash.texi b/dash.texi
index 8eba942..98d74f5 100644
--- a/dash.texi
+++ b/dash.texi
@@ -13,9 +13,9 @@
@copying
-This manual is for @code{dash.el} version 2.12.0.
+This manual is for @code{dash.el} version 2.12.1.
-Copyright © 2012-2015 Free Software Foundation, Inc.
+Copyright © 2012-2015 Magnar Sveen
@quotation
This program is free software; you can redistribute it and/or modify
@@ -124,13 +124,13 @@ Alternatively, you can just dump @verb{~dash.el~} or
Add this to the big comment block at the top:
@lisp
-;; Package-Requires: ((dash "2.12.0"))
+;; Package-Requires: ((dash "2.12.1"))
@end lisp
@noindent To get function combinators:
@lisp
-;; Package-Requires: ((dash "2.12.0") (dash-functional "1.2.0") (emacs "24"))
+;; Package-Requires: ((dash "2.12.1") (dash-functional "1.2.0") (emacs "24"))
@end lisp
@node Syntax highlighting of dash functions
@@ -436,6 +436,8 @@ Return a new list of the items in @var{list} for which
@var{pred} returns a non-
Alias: @code{-select}
+See also: @code{-keep} (@pxref{-keep})
+
@example
@group
(-filter (lambda (num) (= 0 (% num 2))) '(1 2 3 4))
@@ -586,6 +588,8 @@ section is returned. Defaults to 1.
@defun -take (n list)
Return a new list of the first @var{n} items in @var{list}, or all items if
there are fewer than @var{n}.
+See also: @code{-take-last} (@pxref{-take-last})
+
@example
@group
(-take 3 '(1 2 3 4 5))
@@ -598,10 +602,34 @@ Return a new list of the first @var{n} items in
@var{list}, or all items if ther
@end example
@end defun
+@anchor{-take-last}
+@defun -take-last (n list)
+Return the last @var{n} items of @var{list} in order.
+
+See also: @code{-take} (@pxref{-take})
+
+@example
+@group
+(-take-last 3 '(1 2 3 4 5))
+ @result{} '(3 4 5)
+@end group
+@group
+(-take-last 17 '(1 2 3 4 5))
+ @result{} '(1 2 3 4 5)
+@end group
+@group
+(-take-last 1 '(1 2 3 4 5))
+ @result{} '(5)
+@end group
+@end example
+@end defun
+
@anchor{-drop}
@defun -drop (n list)
Return the tail of @var{list} without the first @var{n} items.
+See also: @code{-drop-last} (@pxref{-drop-last})
+
@example
@group
(-drop 3 '(1 2 3 4 5))
@@ -614,6 +642,24 @@ Return the tail of @var{list} without the first @var{n}
items.
@end example
@end defun
+@anchor{-drop-last}
+@defun -drop-last (n list)
+Remove the last @var{n} items of @var{list} and return a copy.
+
+See also: @code{-drop} (@pxref{-drop})
+
+@example
+@group
+(-drop-last 3 '(1 2 3 4 5))
+ @result{} '(1 2)
+@end group
+@group
+(-drop-last 17 '(1 2 3 4 5))
+ @result{} '()
+@end group
+@end example
+@end defun
+
@anchor{-take-while}
@defun -take-while (pred list)
Return a new list of successive items from @var{list} while (@var{pred} item)
returns a non-nil value.
@@ -675,6 +721,53 @@ as `(nth i list)` for all i from @var{indices}.
@end example
@end defun
+@anchor{-select-columns}
+@defun -select-columns (columns table)
+Select @var{columns} from @var{table}.
+
+@var{table} is a list of lists where each element represents one row.
+It is assumed each row has the same length.
+
+Each row is transformed such that only the specified @var{columns} are
+selected.
+
+See also: @code{-select-column} (@pxref{-select-column}),
@code{-select-by-indices} (@pxref{-select-by-indices})
+
+@example
+@group
+(-select-columns '(0 2) '((1 2 3) (a b c) (:a :b :c)))
+ @result{} '((1 3) (a c) (:a :c))
+@end group
+@group
+(-select-columns '(1) '((1 2 3) (a b c) (:a :b :c)))
+ @result{} '((2) (b) (:b))
+@end group
+@group
+(-select-columns nil '((1 2 3) (a b c) (:a :b :c)))
+ @result{} '(nil nil nil)
+@end group
+@end example
+@end defun
+
+@anchor{-select-column}
+@defun -select-column (column table)
+Select @var{column} from @var{table}.
+
+@var{table} is a list of lists where each element represents one row.
+It is assumed each row has the same length.
+
+The single selected column is returned as a list.
+
+See also: @code{-select-columns} (@pxref{-select-columns}),
@code{-select-by-indices} (@pxref{-select-by-indices})
+
+@example
+@group
+(-select-column 1 '((1 2 3) (a b c) (:a :b :c)))
+ @result{} '(2 b :b)
+@end group
+@end example
+@end defun
+
@node List to list
@section List to list
@@ -1542,7 +1635,7 @@ Return a list of ((-take-while @var{pred} @var{list})
(-drop-while @var{pred} @v
@end defun
@anchor{-split-on}
-@defun -split-on (item list)
+@defmac -split-on (item list)
Split the @var{list} each time @var{item} is found.
Unlike @code{-partition-by} (@pxref{-partition-by}), the @var{item} is
discarded from the results.
@@ -1566,7 +1659,7 @@ See also @code{-split-when} (@pxref{-split-when})
@result{} '(("a" "b") ("d" "e"))
@end group
@end example
-@end defun
+@end defmac
@anchor{-split-when}
@defun -split-when (fn list)
@@ -1821,6 +1914,8 @@ Take a predicate @var{pred} and a @var{list} and return
the index of the
first element in the list satisfying the predicate, or nil if
there is no such element.
+See also @code{-first} (@pxref{-first}).
+
@example
@group
(-find-index 'even? '(2 4 1 6 3 3 5 8))
@@ -1843,6 +1938,8 @@ Take a predicate @var{pred} and a @var{list} and return
the index of the
last element in the list satisfying the predicate, or nil if
there is no such element.
+See also @code{-last} (@pxref{-last}).
+
@example
@group
(-find-last-index 'even? '(2 4 1 6 3 3 5 8))
@@ -1926,7 +2023,7 @@ Operations pretending lists are sets.
@anchor{-union}
@defun -union (list list2)
-Return a new list containing the elements of @var{list1} and elements of
@var{list2} that are not in @var{list1}.
+Return a new list containing the elements of @var{list} and elements of
@var{list2} that are not in @var{list}.
The test for equality is done with @code{equal},
or with @code{-compare-fn} if that's non-nil.
@@ -2177,7 +2274,10 @@ second elements of each list, and so on. The lengths of
the returned
groupings are equal to the length of the shortest input list.
If two lists are provided as arguments, return the groupings as a list
-of cons cells. Otherwise, return the groupings as a list of lists.
+of cons cells. Otherwise, return the groupings as a list of lists.
+
+Please note! This distinction is being removed in an upcoming 2.0
+release of Dash. If you rely on this behavior, use -zip-pair instead.
@example
@group
@@ -2701,7 +2801,7 @@ structure such as plist or alist.
@section Threading macros
@anchor{->}
-@defun -> (x &optional form &rest more)
+@defmac -> (x &optional form &rest more)
Thread the expr through the forms. Insert @var{x} as the second item
in the first form, making a list of it if it is not a list
already. If there are more forms, insert the first form as the
@@ -2721,10 +2821,10 @@ second item in second form, etc.
@result{} '(3 5 8)
@end group
@end example
-@end defun
+@end defmac
@anchor{->>}
-@defun ->> (x &optional form &rest more)
+@defmac ->> (x &optional form &rest more)
Thread the expr through the forms. Insert @var{x} as the last item
in the first form, making a list of it if it is not a list
already. If there are more forms, insert the first form as the
@@ -2744,10 +2844,10 @@ last item in second form, etc.
@result{} 14
@end group
@end example
-@end defun
+@end defmac
@anchor{-->}
-@defun --> (x form &rest more)
+@defmac --> (x form &rest more)
Thread the expr through the forms. Insert @var{x} at the position
signified by the token @code{it} in the first form. If there are more
forms, insert the first form at the position signified by @code{it} in
@@ -2767,10 +2867,10 @@ in second form, etc.
@result{} "ABCDEFGHI"
@end group
@end example
-@end defun
+@end defmac
@anchor{-some->}
-@defun -some-> (x &optional form &rest more)
+@defmac -some-> (x &optional form &rest more)
When expr is non-nil, thread it through the first form (via @code{->}
(@pxref{->})),
and when that result is non-nil, through the next form, etc.
@@ -2788,10 +2888,10 @@ and when that result is non-nil, through the next form,
etc.
@result{} nil
@end group
@end example
-@end defun
+@end defmac
@anchor{-some->>}
-@defun -some->> (x &optional form &rest more)
+@defmac -some->> (x &optional form &rest more)
When expr is non-nil, thread it through the first form (via @code{->>}
(@pxref{->>})),
and when that result is non-nil, through the next form, etc.
@@ -2809,10 +2909,10 @@ and when that result is non-nil, through the next form,
etc.
@result{} 106
@end group
@end example
-@end defun
+@end defmac
@anchor{-some-->}
-@defun -some--> (x &optional form &rest more)
+@defmac -some--> (x &optional form &rest more)
When expr in non-nil, thread it through the first form (via @code{-->}
(@pxref{-->})),
and when that result is non-nil, through the next form, etc.
@@ -2830,7 +2930,7 @@ and when that result is non-nil, through the next form,
etc.
@result{} nil
@end group
@end example
-@end defun
+@end defmac
@node Binding
@@ -2841,7 +2941,7 @@ Convenient versions of `let` and `let*` constructs
combined with flow control.
@anchor{-when-let}
-@defun -when-let (var-val &rest body)
+@defmac -when-let (var-val &rest body)
If @var{val} evaluates to non-nil, bind it to @var{var} and execute body.
@var{var-val} should be a (@var{var} @var{val}) pair.
@@ -2861,10 +2961,10 @@ Note: binding is done according to @code{-let}
(@pxref{-let}).
@result{} nil
@end group
@end example
-@end defun
+@end defmac
@anchor{-when-let*}
-@defun -when-let* (vars-vals &rest body)
+@defmac -when-let* (vars-vals &rest body)
If all @var{vals} evaluate to true, bind them to their corresponding
@var{vars} and execute body. @var{vars-vals} should be a list of (@var{var}
@var{val})
pairs.
@@ -2883,10 +2983,10 @@ encountered.
@result{} nil
@end group
@end example
-@end defun
+@end defmac
@anchor{-if-let}
-@defun -if-let (var-val then &rest else)
+@defmac -if-let (var-val then &rest else)
If @var{val} evaluates to non-nil, bind it to @var{var} and do @var{then},
otherwise do @var{else}. @var{var-val} should be a (@var{var} @var{val}) pair.
@@ -2902,10 +3002,10 @@ Note: binding is done according to @code{-let}
(@pxref{-let}).
@result{} t
@end group
@end example
-@end defun
+@end defmac
@anchor{-if-let*}
-@defun -if-let* (vars-vals then &rest else)
+@defmac -if-let* (vars-vals then &rest else)
If all @var{vals} evaluate to true, bind them to their corresponding
@var{vars} and do @var{then}, otherwise do @var{else}. @var{vars-vals} should
be a list
of (@var{var} @var{val}) pairs.
@@ -2928,10 +3028,10 @@ encountered.
@result{} 7
@end group
@end example
-@end defun
+@end defmac
@anchor{-let}
-@defun -let (varlist &rest body)
+@defmac -let (varlist &rest body)
Bind variables according to @var{varlist} then eval @var{body}.
@var{varlist} is a list of lists of the form (@var{pattern} @var{source}).
Each
@@ -3074,10 +3174,10 @@ because we need to support improper list binding.
@result{} '(1 2)
@end group
@end example
-@end defun
+@end defmac
@anchor{-let*}
-@defun -let* (varlist &rest body)
+@defmac -let* (varlist &rest body)
Bind variables according to @var{varlist} then eval @var{body}.
@var{varlist} is a list of lists of the form (@var{pattern} @var{source}).
Each
@@ -3104,10 +3204,10 @@ See @code{-let} (@pxref{-let}) for the list of all
possible patterns.
@result{} '(1 a b c (a b c))
@end group
@end example
-@end defun
+@end defmac
@anchor{-lambda}
-@defun -lambda (match-form &rest body)
+@defmac -lambda (match-form &rest body)
Return a lambda which destructures its input as @var{match-form} and executes
@var{body}.
Note that you have to enclose the @var{match-form} in a pair of parens,
@@ -3136,7 +3236,7 @@ See @code{-let} (@pxref{-let}) for the description of
destructuring mechanism.
@result{} '(2 3 5 6)
@end group
@end example
-@end defun
+@end defmac
@node Side-effects
@@ -3219,12 +3319,31 @@ Repeatedly calls @var{fn} (presumably for side-effects)
passing in integers from
@end example
@end defun
+@anchor{-doto}
+@defmac -doto (eval-initial-value &rest forms)
+Eval a form, then insert that form as the 2nd argument to other forms.
+The @var{eval-initial-value} form is evaluated once. Its result is
+passed to @var{forms}, which are then evaluated sequentially. Returns
+the target form.
+
+@example
+@group
+(-doto '(1 2 3) (!cdr) (!cdr))
+ @result{} '(3)
+@end group
+@group
+(-doto '(1 . 2) (setcar 3) (setcdr 4))
+ @result{} '(3 . 4)
+@end group
+@end example
+@end defmac
+
@node Destructive operations
@section Destructive operations
@anchor{!cons}
-@defun !cons (car cdr)
+@defmac !cons (car cdr)
Destructive: Set @var{cdr} to the cons of @var{car} and @var{cdr}.
@example
@@ -3237,10 +3356,10 @@ Destructive: Set @var{cdr} to the cons of @var{car} and
@var{cdr}.
@result{} '(5 3)
@end group
@end example
-@end defun
+@end defmac
@anchor{!cdr}
-@defun !cdr (list)
+@defmac !cdr (list)
Destructive: Set @var{list} to the cdr of @var{list}.
@example
@@ -3253,7 +3372,7 @@ Destructive: Set @var{list} to the cdr of @var{list}.
@result{} '(5)
@end group
@end example
-@end defun
+@end defmac
@node Function combinators
@@ -3434,7 +3553,7 @@ In types: a -> b -> a
@end defun
@anchor{-cut}
-@defun -cut (&rest params)
+@defmac -cut (&rest params)
Take n-ary function and n arguments and specialize some of them.
Arguments denoted by <> will be left unspecialized.
@@ -3454,11 +3573,11 @@ See @var{srfi-26} for detailed description.
@result{} '(1 3)
@end group
@end example
-@end defun
+@end defmac
@anchor{-not}
@defun -not (pred)
-Take an unary predicates @var{pred} and return an unary predicate
+Take a unary predicate @var{pred} and return a unary predicate
that returns t if @var{pred} returns nil and nil if @var{pred} returns
non-nil.
@@ -3476,7 +3595,7 @@ non-nil.
@anchor{-orfn}
@defun -orfn (&rest preds)
-Take list of unary predicates @var{preds} and return an unary
+Take list of unary predicates @var{preds} and return a unary
predicate with argument x that returns non-nil if at least one of
the @var{preds} returns non-nil on x.
@@ -3496,7 +3615,7 @@ In types: [a -> Bool] -> a -> Bool
@anchor{-andfn}
@defun -andfn (&rest preds)
-Take list of unary predicates @var{preds} and return an unary
+Take list of unary predicates @var{preds} and return a unary
predicate with argument x that returns non-nil if all of the
@var{preds} returns non-nil on x.
@@ -3523,7 +3642,7 @@ In types: [a -> Bool] -> a -> Bool
Return a function @var{fn} composed @var{n} times with itself.
@var{fn} is a unary function. If you need to use a function of higher
-arity, use @code{-applify} (@pxref{-applify}) first to turn it into an unary
function.
+arity, use @code{-applify} (@pxref{-applify}) first to turn it into a unary
function.
With n = 0, this acts as identity function.
- [elpa] externals/dash 0272e8b 017/316: [Fix #158] -map-last does not modify input list., (continued)
- [elpa] externals/dash 0272e8b 017/316: [Fix #158] -map-last does not modify input list., ELPA Syncer, 2021/02/15
- [elpa] externals/dash 1fce650 019/316: Add `-each-indexed` and an anaphoric equivalent (#178), ELPA Syncer, 2021/02/15
- [elpa] externals/dash 7b2845a 011/316: Fix broken GH profile link in README, ELPA Syncer, 2021/02/15
- [elpa] externals/dash 096f244 018/316: --remove-last does not modify input list #158, ELPA Syncer, 2021/02/15
- [elpa] externals/dash 3e7163a 020/316: [#99] Use butlast to implement -butlast, ELPA Syncer, 2021/02/15
- [elpa] externals/dash eef3bb0 023/316: Document -doto macro in the README (#181), ELPA Syncer, 2021/02/15
- [elpa] externals/dash 7cc0149 021/316: [#99] Add -take-last and -drop-last, ELPA Syncer, 2021/02/15
- [elpa] externals/dash 6d8abc7 022/316: Add -doto macro (like Clojure's doto) (#177), ELPA Syncer, 2021/02/15
- [elpa] externals/dash f1c60c4 034/316: Merge pull request #193 from GuiltyDolphin/fix-map-when-typo, ELPA Syncer, 2021/02/15
- [elpa] externals/dash 15f384d 025/316: Copyedit: argument name consistency (#187), ELPA Syncer, 2021/02/15
- [elpa] externals/dash 937f8a1 026/316: Update documentation,
ELPA Syncer <=
- [elpa] externals/dash 012b3bc 024/316: Docstrings grammar fixes (#186), ELPA Syncer, 2021/02/15
- [elpa] externals/dash 6ded2f2 014/316: Add 'see also' to `-find-index` and `-find-last-index`., ELPA Syncer, 2021/02/15
- [elpa] externals/dash e680ad0 015/316: Merge pull request #173 from Wilfred/master, ELPA Syncer, 2021/02/15
- [elpa] externals/dash a10fb6b 028/316: Add -each-indexed keyword to font-lock, ELPA Syncer, 2021/02/15
- [elpa] externals/dash 502be58 029/316: Make -each-indexed indent like -each, ELPA Syncer, 2021/02/15
- [elpa] externals/dash 4ae329a 032/316: Release 2.13.0, ELPA Syncer, 2021/02/15
- [elpa] externals/dash 0100584 033/316: Correct typo of 'does' to 'do' in -map-when docs, ELPA Syncer, 2021/02/15
- [elpa] externals/dash b7ba212 036/316: Edebug support for threading macros (#188), ELPA Syncer, 2021/02/15
- [elpa] externals/dash d4bccfe 037/316: Add annotations to pure functions. (#199), ELPA Syncer, 2021/02/15
- [elpa] externals/dash 4b805e1 041/316: Update README, ELPA Syncer, 2021/02/15