[plt-scheme] redefinition in module

Thanks, I did not catch this from the docs.
Jos

----- Original Message ----- 
From: "Eli Barzilay" <eli at barzilay.org>
To: "Jos Koot" <jos.koot at telefonica.net>
Cc: "Noel Welsh" <noelwelsh at gmail.com>; <plt-scheme at list.cs.brown.edu>
Sent: Friday, February 29, 2008 10:24 PM
Subject: Re: [plt-scheme] redefinition in module


> On Feb 29, Jos Koot wrote:
>> I noticed that for does not include a clause like (var from last
>> step), where from last and step are real numbers and the number of
>> iterations is determined by (inexact->exact (floor (/ (past from)
>> step)))) (as opposed to accumulated addition of the step to the
>> start)
> 
> (for/list ([x (in-range 1.4 7.4 0.2)]) x)
> 
> 
>> I can also imagine iteration over the entries in a hash-table.
> 
> (for/list ([(k v) #hasheq((a . 1) (b . 2))]) (list k v))
> 
> 
>> I also noticed that a fender clause has peculiar influence on the
>> nesting of iterations.
> 
> Yes, but that's intended, if you don't want that, then put it after
> the clauses.
> 
> -- 
>          ((lambda (x) (x x)) (lambda (x) (x x)))          Eli Barzilay:
>                  http://www.barzilay.org/                 Maze is Life!