On Feb 28, 2009, at 2:38 PM, Rich Hickey wrote:
>
> I've added letfn, which lets you define mutually recursive local
> functions a la CL's labels.
>
> (defn ring [n]
> (letfn [(a [n] (if (zero? n) n (b (dec n
> (b [n] (if (zero? n) n (c (dec n
> (c [n] (if (zero? n)
On Mar 1, 2009, at 4:18 PM, Konrad Hinsen wrote:
>
> On 01.03.2009, at 01:38, Rich Hickey wrote:
>
>> I've added letfn, which lets you define mutually recursive local
>> functions a la CL's labels.
>>
>> (defn ring [n]
>> (letfn [(a [n] (if (zero? n) n (b (dec n
>> (b [n] (if (zero
On 01.03.2009, at 01:38, Rich Hickey wrote:
> I've added letfn, which lets you define mutually recursive local
> functions a la CL's labels.
>
> (defn ring [n]
> (letfn [(a [n] (if (zero? n) n (b (dec n
> (b [n] (if (zero? n) n (c (dec n
> (c [n] (if (zero? n) n (a (
On Sat, Feb 28, 2009 at 7:38 PM, Rich Hickey wrote:
>
> I've added letfn, which lets you define mutually recursive local
> functions a la CL's labels.
>
> (defn ring [n]
> (letfn [(a [n] (if (zero? n) n (b (dec n
> (b [n] (if (zero? n) n (c (dec n
> (c [n] (if (zero? n)
I've added letfn, which lets you define mutually recursive local
functions a la CL's labels.
(defn ring [n]
(letfn [(a [n] (if (zero? n) n (b (dec n
(b [n] (if (zero? n) n (c (dec n
(c [n] (if (zero? n) n (a (dec n]
(c n)))
(ring 1000)
Note this is still s