emacs-elpa-diffs
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[elpa] externals/dash f0831d3 339/426: Add -lambda


From: Phillip Lord
Subject: [elpa] externals/dash f0831d3 339/426: Add -lambda
Date: Tue, 04 Aug 2015 19:38:43 +0000

branch: externals/dash
commit f0831d3ab9f5c6dcca6d52f8688d94d52af983fd
Author: Matus Goljer <address@hidden>
Commit: Matus Goljer <address@hidden>

    Add -lambda
---
 README.md       |   23 +++++++++++++++++++++++
 dash.el         |   26 ++++++++++++++++++++++++++
 dev/examples.el |    9 ++++++++-
 3 files changed, 57 insertions(+), 1 deletions(-)

diff --git a/README.md b/README.md
index d47a2fe..a065eec 100644
--- a/README.md
+++ b/README.md
@@ -219,6 +219,7 @@ Convenient versions of `let` and `let*` constructs combined 
with flow control.
 * [-if-let*](#-if-let-vars-vals-then-rest-else) `(vars-vals then &rest else)`
 * [-let](#-let-varlist-rest-body) `(varlist &rest body)`
 * [-let*](#-let-varlist-rest-body) `(varlist &rest body)`
+* [-lambda](#-lambda-match-form-rest-body) `(match-form &rest body)`
 
 ### Side-effects
 
@@ -1802,6 +1803,28 @@ See `-let` for the list of all possible patterns.
 (-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))
 ```
 
+#### -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)
+
+has the usual semantics of `lambda`.  Furthermore, these get
+translated into normal lambda, so there is no performance
+penalty.
+
+See `-let` for the description of destructuring mechanism.
+
+```cl
+(-map (-lambda ((x y)) (+ x y)) '((1 2) (3 4) (5 6))) ;; => '(3 7 11)
+(-map (-lambda ([x y]) (+ x y)) '([1 2] [3 4] [5 6])) ;; => '(3 7 11)
+(-map (-lambda ((&plist :a a :b b)) (+ a b)) '((:a 1 :b 2) (:a 3 :b 4) (:a 5 
:b 6))) ;; => '(3 7 11)
+```
+
 
 ## Side-effects
 
diff --git a/dash.el b/dash.el
index 6fd4fdb..9b32668 100644
--- a/dash.el
+++ b/dash.el
@@ -1404,6 +1404,31 @@ Key/value stores:
       `(let ,inputs
          (-let* ,new-varlist ,@body)))))
 
+(defmacro -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)
+
+has the usual semantics of `lambda'.  Furthermore, these get
+translated into normal lambda, so there is no performance
+penalty.
+
+See `-let' for the description of destructuring mechanism."
+  (cond
+   ((not (consp match-form))
+    (error "match-form must be a list"))
+   ;; no destructuring, so just return regular lambda to make things faster
+   ((and (consp match-form)
+         (symbolp (car match-form)))
+    `(lambda ,match-form ,@body))
+   (t
+    `(lambda (x)
+       (-let* ((,@match-form x)) ,@body)))))
+
 (defun -distinct (list)
   "Return a new list with all duplicates removed.
 The test for equality is done with `equal',
@@ -1951,6 +1976,7 @@ structure such as plist or alist."
                              "--if-let"
                              "-let*"
                              "-let"
+                             "-lambda"
                              "-distinct"
                              "-uniq"
                              "-union"
diff --git a/dev/examples.el b/dev/examples.el
index fa9fdd5..2bd0ee1 100644
--- a/dev/examples.el
+++ b/dev/examples.el
@@ -752,7 +752,14 @@ new list."
       (-let* (((a . b) a)
               ((c . d) b)) ;; b here comes from above binding
         (list a b c d))) => '(1 (2 3) 2 (3))
-    (-let* ((a "foo") (b a)) (list a b)) => '("foo" "foo")))
+    (-let* ((a "foo") (b a)) (list a b)) => '("foo" "foo"))
+
+  (defexamples -lambda
+    (-map (-lambda ((x y)) (+ x y)) '((1 2) (3 4) (5 6))) => '(3 7 11)
+    (-map (-lambda ([x y]) (+ x y)) '([1 2] [3 4] [5 6])) => '(3 7 11)
+    (-map (-lambda ((&plist :a a :b b)) (+ a b)) '((:a 1 :b 2) (:a 3 :b 4) (:a 
5 :b 6))) => '(3 7 11)
+    (-map (-lambda (x) (let ((k (car x)) (v (cadr x))) (+ k v))) '((1 2) (3 4) 
(5 6))) => '(3 7 11)
+    (condition-case nil (progn (-lambda a t) (error "previous form should 
error")) (error t)) => t))
 
 (def-example-group "Side-effects"
   "Functions iterating over lists for side-effect only."



reply via email to

[Prev in Thread] Current Thread [Next in Thread]