Comments on: Another LINQ puzzle

By: Little LINQ puzzle | Igor Ostrovsky Blogging

Little LINQ puzzle | Igor Ostrovsky Blogging — Wed, 09 Sep 2009 07:07:44 +0000

[...] For a slightly harder challenge, check out the next puzzle. [...]

Roman — Wed, 17 Sep 2008 15:31:13 +0000

Because there is recursive enumeration of q (-> closure) which is more evident if you rewrite it as:

q = new int[] { 1, 2 }.SelectMany(x => q, (x, y) => x + y);

when ToArray is called q is defined as above.

if you switch order there is no closure
q.SelectMany(y => new int[] { 1, 2 }, (x, y) => x + y);

TJ — Tue, 16 Sep 2008 20:54:54 +0000

haha, cmon people who uses VB anymore. Is it really that hard to figure out the difference between C# and VB?

Igor Ostrovsky — Mon, 15 Sep 2008 07:19:41 +0000

@Scorcels: Here is a VB version of the puzzle.

Dim q As IEnumerable(Of Integer) = Enumerable.Range(1, 2)
q = From x In Enumerable.Range(1, 2) _
From y In q _
Select x + y
q.ToArray()

Scorcels — Mon, 15 Sep 2008 05:43:52 +0000

Do you have VB version?

Thanks