From b5a5790d2075a6cfcca32c7ad0809c76582e40ff Mon Sep 17 00:00:00 2001 From: Ted Zlatanov Date: Fri, 22 Dec 2017 08:49:21 -0500 Subject: [PATCH] * lisp/registry.el (registry-collect-prune-candidates): Skip invalid entries --- lisp/registry.el | 5 +++-- 1 file 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. -- 2.39.2