GNU bug report logs - #28753
25.3; Functions to get alist from hash table and vice versa

Previous Next

Full log

Message #50 received at 28753 <at> debbugs.gnu.org (full text, mbox):

From: Drew Adams <drew.adams <at> oracle.com>
To: Philipp Stephani <p.stephani2 <at> gmail.com>, Michael Heerdegen
 <michael_heerdegen <at> web.de>
Cc: Nicolas Petton <nicolas <at> petton.fr>, 28753 <at> debbugs.gnu.org,
 Noam Postavsky <npostavs <at> users.sourceforge.net>
Subject: RE: bug#28753: 25.3; Functions to get alist from hash table and vice
 versa
Date: Sat, 30 Dec 2017 13:08:08 -0800 (PST)

> I don't think a unified conversion interface is that important.
> The various structures used for mappings are just too different.
> For example, alists and plists aren't real types, they are only
> defined by their usage. Hash tables, on the other hand, are real
> types, with a per-object comparison function, a non-nil empty
> value, etc. These two kinds of objects are just too different
> to treat uniformly. Also, in most cases it is statically known
> which kinds of objects are involved, so a generic function that
> dynamically selects on the type of object isn't that useful.
>
> How about adding some simple conversion functions to subr.el such as
> 
> (defun alist-to-hashtable (alist &rest keys) ...) 
> (defun hashtable-to-alist (hashtable) ...)

Which brings us back to the very first msg of this thread -
the bug report.  Please see the code I proposed there.

And note the differences from the signature you show for
`alist-to-hashtable'.  I think those differences are
important and your signature is not satisfactory.

Previous Next

GNU bug tracking system
Copyright (C) 1999 Darren O. Benham, 1997,2003 nCipher Corporation Ltd, 1994-97 Ian Jackson.