emacs-devel
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: hash-table-{to, from}-alist


From: Ted Zlatanov
Subject: Re: hash-table-{to, from}-alist
Date: Wed, 26 Nov 2008 14:37:28 -0600
User-agent: Gnus/5.110011 (No Gnus v0.11) Emacs/23.0.60 (gnu/linux)

On Wed, 26 Nov 2008 13:10:38 -0500 Stefan Monnier <address@hidden> wrote: 

SM> The same way as the other circularities.  I.e. it should mostly
SM> "just work", except you'll have to change the code that does the
SM> first pass so that it doesn't skip hash tables.
>> Sorry, I don't know what you mean.  My iterator doesn't skip hash
>> tables, does it?  Or are you discussing something else?

SM> The print code does 2 passes over the data: a first one to collect the
SM> set of objects it's going to print, and a second to do the actual print.
SM> This 2-pass approach is done to handle cycles and sharing (so that when
SM> an object appears several times in the output, we know it right when we
SM> print the first occurrence).  IIUC your patch only patches the second
SM> pass, but not the first.

I'll research this, thanks for explaining.

>> IMHO hashtables should always be printed completely and should be
>> treated like lists and vectors.  If, however, compatibility with
>> XEmacs is desired or people feel strongly for print-readably, I will
>> implement with print-readably.

SM> char tables are always printed in full and we haven't had any complaints
SM> about that, so you're probably right: let's just always print them
SM> in full.  If it turns out to be problematic in some cases, we can later
SM> on add some extra variable to control the level of detail.

Great.  Maybe XEmacs should add print-unreadably ;)

Ted





reply via email to

[Prev in Thread] Current Thread [Next in Thread]