Re: [Scheme-reports] Seeking review of sets and hash tables proposals

[Alaric Snell-Pym <alaric@x>]

On 25/05/13 02:17, Evan Hanson wrote:

> I like this idea, but it would probably come with lots of complications.
> For example, one wouldn't be able to rely on the ability to round-trip
> such an object through its written representation (and what exactly
> should happen when the equivalence is not the default? Raise an error?
> Write "#<hash-table>" instead? How would one test its printability?).

That issue already holds for lists and vectors; one needs to check
up-front if they contain any closures or other non-printable objects to
tell if they are printable.

In practice, one tends to deliberately build printable objects when one
intends to print them - data stored with s-expressions, configuration
files or protocols based on them tend to have some kind of "schema"
defined, which consists purely of portable objects.

>
> Evan
>

ABS

--
Alaric Snell-Pym
http://www.snell-pym.org.uk/alaric/

_______________________________________________
Scheme-reports mailing list
Scheme-reports@x
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports