mirror/emacs
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/emacs.git synced 2024-11-23 07:19:15 +00:00
Code Issues Releases Activity

Fix bug with precious entries in Gnus registry

Browse Source 
* lisp/registry.el (registry-collect-prune-candidates): This `cdr' was
  an error: it meant that the last key in the precious list, would be
  considered a nil. Since the precious list only contains the symbol
  'mark by default, marks were never considered precious.
* doc/misc/gnus.texi (Store arbitrary data): Fix typo: "marks" should
  be "mark".
This commit is contained in:
Eric Abrahamsen 2018-10-11 11:20:29 -07:00
parent ce8b4584a3
commit a108eaa13c
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
doc/misc/gnus.texi
View File

@ -26159,7 +26159,7 @@ Get the data under @code{key} for message @code{id}.
If any extra entries are precious, their presence will make the If any extra entries are precious, their presence will make the
registry keep the whole entry forever, even if there are no groups for registry keep the whole entry forever, even if there are no groups for
the Message-ID and if the size limit of the registry is reached. By the Message-ID and if the size limit of the registry is reached. By
default this is just @code{(marks)} so the custom registry marks are default this is just @code{(mark)} so the custom registry marks are
precious. precious.
@end defvar @end defvar

2
lisp/registry.el
View File

@ -358,7 +358,7 @@ return LIMIT such candidates. If SORTFUNC is provided, sort
entries first and return candidates from beginning of list." entries first and return candidates from beginning of list."
(let* ((precious (oref db precious)) (let* ((precious (oref db precious))
(precious-p (lambda (entry-key) (precious-p (lambda (entry-key)
(cdr (memq (car entry-key) precious)))) (memq (car entry-key) precious)))
(data (oref db data)) (data (oref db data))
(candidates (cl-loop for k being the hash-keys of data (candidates (cl-loop for k being the hash-keys of data
using (hash-values v) using (hash-values v)