Re: Quick permutations

• To: info-dylan@ai.mit.edu
• Subject: Re: Quick permutations
• From: Andreas Bogk <andreas@andreas.org>
• Date: Mon, 22 Jan 2001 08:00:02 -0500 (EST)
• Organization: There Is No Cabal.
• References: <94ac3d$6j9$1@nnrp1.deja.com> <3A6C109B.7EC3D53C@h2g2.com>
• Sender: andreas@teonanacatl.andreas.org
• User-Agent: Gnus/5.0806 (Gnus v5.8.6) XEmacs/21.1 (Capitol Reef)
• Xref: traf.lcs.mit.edu comp.lang.dylan:13012

Rob <robm@h2g2.com> writes:

> I keep hearing Lispish voices in my head about map() but I don't know
> what's best for a single collection in Dylan. Try to break down the task
> to use for( x in seq ) rather than map. Maybe.

In Gwydion Dylan, there's no difference between using maps and
loops. The compiler recognizes map, reduce et al., and converts them
to loop constructs.

If the compiler were smart enough, it could do the conversion for all
functions, by tail recursion removal and inlining. I don't know
whether it is or not...

Andreas

• Quick permutations
• From: dauclair@hotmail.com
• Re: Quick permutations
• From: Rob <robm@h2g2.com>

• Prev: Re from jt & Eric Gouriou: Quick permutations
• Next: Re: Quick permutations
• Index(es):
  • Main
  • Thread