`(pcase-let ((,(map--make-pcase-patterns keys) ,map))
,@body))
-(defmacro map--dispatch (spec &rest args)
- "Evaluate one of the forms specified by ARGS based on the type of MAP.
-
-SPEC can be a map or a list of the form (VAR MAP [RESULT]).
-ARGS should have the form [TYPE FORM]...
+(eval-when-compile
+ (defmacro map--dispatch (map-var &rest args)
+ "Evaluate one of the forms specified by ARGS based on the type of MAP.
The following keyword types are meaningful: `:list',
`:hash-table' and `:array'.
An error is thrown if MAP is neither a list, hash-table nor array.
-Return RESULT if non-nil or the result of evaluation of the
-form.
-
-\(fn (VAR MAP [RESULT]) &rest ARGS)"
- (declare (debug t) (indent 1))
- (unless (listp spec)
- (setq spec `(,spec ,spec)))
- (let ((map-var (car spec))
- (result-var (make-symbol "result")))
- `(let ((,map-var ,(cadr spec))
- ,result-var)
- (setq ,result-var
- (cond ((listp ,map-var) ,(plist-get args :list))
- ((hash-table-p ,map-var) ,(plist-get args :hash-table))
- ((arrayp ,map-var) ,(plist-get args :array))
- (t (error "Unsupported map: %s" ,map-var))))
- ,@(when (cddr spec)
- `((setq ,result-var ,@(cddr spec))))
- ,result-var)))
+Return RESULT if non-nil or the result of evaluation of the form."
+ (declare (debug t) (indent 1))
+ `(cond ((listp ,map-var) ,(plist-get args :list))
+ ((hash-table-p ,map-var) ,(plist-get args :hash-table))
+ ((arrayp ,map-var) ,(plist-get args :array))
+ (t (error "Unsupported map: %s" ,map-var)))))
(defun map-elt (map key &optional default)
"Perform a lookup in MAP of KEY and return its associated value.
If MAP is a list, `eql' is used to lookup KEY.
MAP can be a list, hash-table or array."
+ (declare
+ (gv-expander
+ (lambda (do)
+ (gv-letplace (mgetter msetter) `(gv-delay-error ,map)
+ (macroexp-let2* nil
+ ;; Eval them once and for all in the right order.
+ ((key key) (default default))
+ `(if (listp ,mgetter)
+ ;; Special case the alist case, since it can't be handled by the
+ ;; map--put function.
+ ,(gv-get `(alist-get ,key (gv-synthetic-place
+ ,mgetter ,msetter)
+ ,default)
+ do)
+ ,(funcall do `(map-elt ,mgetter ,key ,default)
+ (lambda (v) `(map--put ,mgetter ,key ,v)))))))))
(map--dispatch map
:list (alist-get key map default)
:hash-table (gethash key map default)
- :array (map--elt-array map key default)))
+ :array (if (and (>= key 0) (< key (seq-length map)))
+ (seq-elt map key)
+ default)))
(defmacro map-put (map key value)
"In MAP, associate KEY with VALUE and return MAP.
with VALUE.
MAP can be a list, hash-table or array."
- (declare (debug t))
- (let ((symbol (symbolp map)))
+ (macroexp-let2 nil map map
`(progn
- (map--dispatch (m ,map m)
- :list (if ,symbol
- (setq ,map (cons (cons ,key ,value) m))
- (error "Literal lists are not allowed, %s must be a symbol" ',map))
- :hash-table (puthash ,key ,value m)
- :array (aset m ,key ,value)))))
+ (setf (map-elt ,map ,key) ,value)
+ ,map)))
(defmacro map-delete (map key)
"In MAP, delete the key KEY if present and return MAP.
MAP can be a list, hash-table or array."
(declare (debug t))
- (let ((symbol (symbolp map)))
- `(progn
- (map--dispatch (m ,map m)
- :list (if ,symbol
- (setq ,map (map--delete-alist m ,key))
- (error "Literal lists are not allowed, %s must be a symbol" ',map))
- :hash-table (remhash ,key m)
- :array (map--delete-array m ,key)))))
+ (gv-letplace (mgetter msetter) `(gv-delay-error ,map)
+ (macroexp-let2 nil key key
+ `(if (not (listp ,mgetter))
+ (map--delete ,mgetter ,key)
+ ;; The alist case is special, since it can't be handled by the
+ ;; map--delete function.
+ (setf (alist-get ,key (gv-synthetic-place ,mgetter ,msetter)
+ nil t)
+ nil)
+ ,mgetter))))
(defun map-nested-elt (map keys &optional default)
"Traverse MAP using KEYS and return the looked up value or DEFAULT if nil.
(let (result)
(while maps
(map-apply (lambda (key value)
- (map-put result key value))
+ (setf (map-elt result key) value))
(pop maps)))
(map-into result type)))
(`hash-table (map--into-hash-table map))
(_ (error "Not a map type name: %S" type))))
+(defun map--put (map key v)
+ (map--dispatch map
+ :list (let ((p (assoc key map)))
+ (if p (setcdr p v)
+ (error "No place to change the mapping for %S" key)))
+ :hash-table (puthash key v map)
+ :array (aset map key v)))
+
(defun map--apply-alist (function map)
"Private function used to apply FUNCTION over MAP, MAP being an alist."
(seq-map (lambda (pair)
(cdr pair)))
map))
+(defun map--delete (map key)
+ (map--dispatch map
+ :list (error "No place to remove the mapping for %S" key)
+ :hash-table (remhash key map)
+ :array (and (>= key 0)
+ (<= key (seq-length map))
+ (aset map key nil)))
+ map)
+
(defun map--apply-hash-table (function map)
"Private function used to apply FUNCTION over MAP, MAP being a hash-table."
(let (result)
(setq index (1+ index))))
map)))
-(defun map--elt-array (map key &optional default)
- "Return the element of the array MAP at the index KEY.
-If KEY is not found, return DEFAULT which defaults to nil."
- (let ((len (seq-length map)))
- (or (and (>= key 0)
- (<= key len)
- (seq-elt map key))
- default)))
-
-(defun map--delete-alist (map key)
- "Return MAP with KEY removed."
- (seq-remove (lambda (pair)
- (equal key (car pair)))
- map))
-
-(defun map--delete-array (map key)
- "Set nil in the array MAP at the index KEY if present and return MAP."
- (let ((len (seq-length map)))
- (and (>= key 0)
- (<= key len)
- (aset map key nil)))
- map)
-
(defun map--into-hash-table (map)
"Convert MAP into a hash-table."
(let ((ht (make-hash-table :size (map-length map)
:test 'equal)))
(map-apply (lambda (key value)
- (map-put ht key value))
+ (setf (map-elt ht key) value))
map)
ht))
-;;; map-tests.el --- Tests for map.el
+;;; map-tests.el --- Tests for map.el -*- lexical-binding:t -*-
;; Copyright (C) 2015 Free Software Foundation, Inc.
(let ((alist (make-symbol "alist"))
(vec (make-symbol "vec"))
(ht (make-symbol "ht")))
- `(let ((,alist '((0 . 3)
- (1 . 4)
- (2 . 5)))
- (,vec (make-vector 3 nil))
+ `(let ((,alist (list (cons 0 3)
+ (cons 1 4)
+ (cons 2 5)))
+ (,vec (vector 3 4 5))
(,ht (make-hash-table)))
- (aset ,vec 0 '3)
- (aset ,vec 1 '4)
- (aset ,vec 2 '5)
- (puthash '0 3 ,ht)
- (puthash '1 4 ,ht)
- (puthash '2 5 ,ht)
+ (puthash 0 3 ,ht)
+ (puthash 1 4 ,ht)
+ (puthash 2 5 ,ht)
(dolist (,var (list ,alist ,vec ,ht))
,@body))))
'2))))
(ert-deftest test-map-put ()
+ (with-maps-do map
+ (setf (map-elt map 2) 'hello)
+ (should (eq (map-elt map 2) 'hello)))
(with-maps-do map
(map-put map 2 'hello)
(should (eq (map-elt map 2) 'hello)))
(let ((ht (make-hash-table)))
- (map-put ht 2 'a)
+ (setf (map-elt ht 2) 'a)
(should (eq (map-elt ht 2)
'a)))
(let ((alist '((0 . a) (1 . b) (2 . c))))
- (map-put alist 2 'a)
+ (setf (map-elt alist 2) 'a)
(should (eq (map-elt alist 2)
'a)))
(let ((vec [3 4 5]))
- (should-error (map-put vec 3 6))))
-
-(ert-deftest test-map-put-literal ()
- (should (= (map-elt (map-put [1 2 3] 1 4) 1)
- 4))
- (should (= (map-elt (map-put (make-hash-table) 'a 2) 'a)
- 2))
- (should-error (map-put '((a . 1)) 'b 2))
- (should-error (map-put '() 'a 1)))
+ (should-error (setf (map-elt vec 3) 6))))
(ert-deftest test-map-put-return-value ()
(let ((ht (make-hash-table)))
(let ((ht (make-hash-table)))
(should (eq (map-delete ht 'a) ht))))
-(ert-deftest test-map-nested-elt ()
- (let ((vec [a b [c d [e f]]]))
- (should (eq (map-nested-elt vec '(2 2 0)) 'e)))
- (let ((alist '((a . 1)
- (b . ((c . 2)
- (d . 3)
- (e . ((f . 4)
- (g . 5))))))))
- (should (eq (map-nested-elt alist '(b e f))
- 4)))
- (let ((ht (make-hash-table)))
- (map-put ht 'a 1)
- (map-put ht 'b (make-hash-table))
- (map-put (map-elt ht 'b) 'c 2)
- (should (eq (map-nested-elt ht '(b c))
- 2))))
+;; (ert-deftest test-map-nested-elt ()
+;; (let ((vec [a b [c d [e f]]]))
+;; (should (eq (map-nested-elt vec '(2 2 0)) 'e)))
+;; (let ((alist '((a . 1)
+;; (b . ((c . 2)
+;; (d . 3)
+;; (e . ((f . 4)
+;; (g . 5))))))))
+;; (should (eq (map-nested-elt alist '(b e f))
+;; 4)))
+;; (let ((ht (make-hash-table)))
+;; (setf (map-elt ht 'a) 1)
+;; (setf (map-elt ht 'b) (make-hash-table))
+;; (setf (map-elt (map-elt ht 'b) 'c) 2)
+;; (should (eq (map-nested-elt ht '(b c))
+;; 2))))
(ert-deftest test-map-nested-elt-default ()
(let ((vec [a b [c d]]))
(ert-deftest test-map-filter ()
(with-maps-do map
- (should (equal (map-keys (map-filter (lambda (k v)
+ (should (equal (map-keys (map-filter (lambda (_k v)
(<= 4 v))
map))
'(1 2)))
- (should (null (map-filter (lambda (k v)
+ (should (null (map-filter (lambda (k _v)
(eq 'd k))
map))))
- (should (null (map-filter (lambda (k v)
+ (should (null (map-filter (lambda (_k v)
(eq 3 v))
[1 2 4 5])))
- (should (equal (map-filter (lambda (k v)
+ (should (equal (map-filter (lambda (k _v)
(eq 3 k))
[1 2 4 5])
'((3 . 5)))))
(ert-deftest test-map-remove ()
(with-maps-do map
- (should (equal (map-keys (map-remove (lambda (k v)
+ (should (equal (map-keys (map-remove (lambda (_k v)
(>= v 4))
map))
'(0)))
- (should (equal (map-keys (map-remove (lambda (k v)
+ (should (equal (map-keys (map-remove (lambda (k _v)
(eq 'd k))
map))
(map-keys map))))
- (should (equal (map-remove (lambda (k v)
+ (should (equal (map-remove (lambda (_k v)
(eq 3 v))
[1 2 4 5])
'((0 . 1)
(1 . 2)
(2 . 4)
(3 . 5))))
- (should (null (map-remove (lambda (k v)
+ (should (null (map-remove (lambda (k _v)
(>= k 0))
[1 2 4 5]))))
(ert-deftest test-map-some-p ()
(with-maps-do map
- (should (equal (map-some-p (lambda (k v)
+ (should (equal (map-some-p (lambda (k _v)
(eq 1 k))
map)
(cons 1 4)))
- (should (not (map-some-p (lambda (k v)
+ (should (not (map-some-p (lambda (k _v)
(eq 'd k))
map))))
(let ((vec [a b c]))
- (should (equal (map-some-p (lambda (k v)
+ (should (equal (map-some-p (lambda (k _v)
(> k 1))
vec)
(cons 2 'c)))
- (should (not (map-some-p (lambda (k v)
+ (should (not (map-some-p (lambda (k _v)
(> k 3))
vec)))))
(ert-deftest test-map-every-p ()
(with-maps-do map
- (should (map-every-p (lambda (k v)
+ (should (map-every-p (lambda (k _v)
k)
map))
- (should (not (map-every-p (lambda (k v)
+ (should (not (map-every-p (lambda (_k _v)
nil)
map))))
(let ((vec [a b c]))
- (should (map-every-p (lambda (k v)
+ (should (map-every-p (lambda (k _v)
(>= k 0))
vec))
- (should (not (map-every-p (lambda (k v)
+ (should (not (map-every-p (lambda (k _v)
(> k 3))
vec)))))
(should (null baz)))
(map-let (('foo a)
('bar b)
- ('baz c)) '((foo . 1) (bar . 2))
+ ('baz c))
+ '((foo . 1) (bar . 2))
(should (= a 1))
(should (= b 2))
(should (null c))))
projects / emacs.git / commitdiff