[plt-scheme] cost of closure?

From: YC (yinso.chen at gmail.com)
Date: Fri Jun 1 15:51:25 EDT 2007

IMO, Tuple is dissimilar from hash in that the fields are both named and
ordered (like a struct - that's why I call it an anonymous struct), where as
hashes have no guarantee on the order of the fields...  in a way tuple is
similar to alist.

CTOR and dtor are needed for properly acquire and release external resources
- but this might not be the scheme way... I don't know for sure yet.


On 5/31/07, Carl Eastlund <cce at ccs.neu.edu> wrote:
> On 6/1/07, YC <yinso.chen at gmail.com> wrote:
> > Tuples differ from vectors that they are indexed both by name & numbers,
> but
> > if struct is a named vector, in that sense it won't really be different,
> > except struct is opaque and hence better for building AST than vector
> Ok, you want tuples with labelled fields.  Now they sound more like
> hash tables on symbols or strings.  Are they anything beyond that?
> --
> Carl Eastlund
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20070601/5e0399ae/attachment.html>

Posted on the users mailing list.