diff options
| author | Ted Zlatanov <tzz@lifelogs.com> | 2017-12-22 08:49:21 -0500 |
|---|---|---|
| committer | Ted Zlatanov <tzz@lifelogs.com> | 2017-12-22 08:49:21 -0500 |
| commit | b5a5790d2075a6cfcca32c7ad0809c76582e40ff (patch) | |
| tree | 0866301100655136e889db46a25a910f4e7d039e | |
| parent | e92f5537a8222187525ef5066dba051211db5290 (diff) | |
| download | emacs-b5a5790d2075a6cfcca32c7ad0809c76582e40ff.tar.gz | |
* lisp/registry.el (registry-collect-prune-candidates): Skip invalid entries
| -rw-r--r-- | lisp/registry.el | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/lisp/registry.el b/lisp/registry.el index 17dc23d68e8..3d0502a8f42 100644 --- a/lisp/registry.el +++ b/lisp/registry.el @@ -358,11 +358,12 @@ return LIMIT such candidates. If SORTFUNC is provided, sort entries first and return candidates from beginning of list." (let* ((precious (oref db precious)) (precious-p (lambda (entry-key) - (cdr (memq (car entry-key) precious)))) + (cdr (memq (car-safe entry-key) precious)))) (data (oref db data)) (candidates (cl-loop for k being the hash-keys of data using (hash-values v) - when (cl-notany precious-p v) + when (and (listp v) + (cl-notany precious-p v)) collect (cons k v)))) ;; We want the full entries for sorting, but should only return a ;; list of entry keys. |