[plt-scheme] 2htdp/image questions

From: Robby Findler (robby at eecs.northwestern.edu)
Date: Sun Apr 18 10:51:54 EDT 2010

On Sun, Apr 18, 2010 at 9:27 AM, Stephen Bloch <sbloch at adelphi.edu> wrote:
> BTW, if two images both already had cached bitmaps, would it be faster or
> slower to compare the bitmaps than to do the usual tree-traversal equality?

Much slower in the common case.

>  I guess that would depend on the size of the bitmaps, and the complexity of
> the tree....

Yes, of course, in general.

But I really believe that if you want to be writing such functions you
don't want 2htdp/image. You want a completely different


Posted on the users mailing list.