News for hackers. Stuff that matters.
Re:Breaking a Toy Hash Function by tomp on Tuesday July 02, 2013 @03:22AM (#5976299)
Wow! I've never before seen C# LINQ in action. I must say, it's amazing! I hope more languages would adopt this.
Re:Breaking a Toy Hash Function by thecoffman on Tuesday July 02, 2013 @11:39AM (#5978524)
I generally program on the Linux platform and use Ruby, Java, a bit of Perl and occasionally C++. In one previous job however, I did Windows development in C#. Whenever I tell people that C# is a seriously awesome language they look at me like I'm crazy; but its true. In many ways Java is still years and years behind C# for a general purpose OO language. It is really a shame that (outside of Mono), C# is trapped over in Windows land.

LINQ is incredibly awesome, expressive, and powerful. I generally prefer the lambda syntax to the more verbal syntax the author has used here, but both are really great and miles ahead of what's available in other, similar languages.

Re:Breaking a Toy Hash Function by tehwalrus on Tuesday July 02, 2013 @04:37AM (#5976519)
I vaguely remember LINQ from when I had a real job, but this is way cooler. I just remembered it as chained function calls on a database query return (you could do your filtering in C# instead of in the SQL) but this just looks like SQL (or better - python) in C#.
Re:Breaking a Toy Hash Function by WickyNilliams on Tuesday July 02, 2013 @07:57AM (#5977185)
LINQ comes in many flavours e.g. LINQ to XML, LINQ to Objects. You're talking about LINQ to SQL. The chained function calls are equivalent to the more SQL-style LINQ, it's a matter of personal preference and which sits better given the context. Personally I always prefer the chained methods with lambdas.

However don't let the seemingly chained methods fool you! The great thing about LINQ is that is defers execution, by building an expression tree [1], meaning the code is lazily executed only when needed. And the expression tree means that everything (filtering, projection etc) is done in a single for loop [2]. e.g.

    var results = collection.Select(item => item.Foo).Where(foo => foo < 3);
This builds an expression tree, but no work has been undertaken on our collection. When we attempt to enumerate the results, the expression tree is converted to code (again, as a single for loop, not multiple iterations as the code might seem):

    results.ToList();
It's extremely cool to work with and highly expressive. One of my favourite features of C#

[1] http://blogs.msdn.com/b/charlie/archive/2007/12/09/deferred-...

[2] http://stackoverflow.com/questions/7324033/what-are-the-bene...

Re:Breaking a Toy Hash Function by lucian1900 on Tuesday July 02, 2013 @07:54AM (#5977176)
The syntax in the article desugars to the method calls you remember (which are the common HOFs). Since the calls are lazy, they can also generate SQL when asked to execute.
Re:Breaking a Toy Hash Function by dashN9ne on Tuesday July 02, 2013 @01:18PM (#5979293)
I've not heard the term 'HOF' before and didn't find it/expand it with a cursory search. Could you define/expand it?
Re:Breaking a Toy Hash Function by lucian1900 on Tuesday July 02, 2013 @01:29PM (#5979377)
I had (mistakenly) thought it's a commonly known term.

Wikipedia explains it better than I could http://en.wikipedia.org/wiki/Higher-order_function

Re:Breaking a Toy Hash Function by tel on Tuesday July 02, 2013 @12:00PM (#5978708)
LINQ exists, to some degree, in the list comprehensions of Python and to a large degree in the for-comprehensions of Scala and many of the Monads of Haskell.

The monadic interfaces can get much more powerful, such as the Logic Monad in Haskell which embeds Prolog-like search.

Re:Breaking a Toy Hash Function by zeckalpha on Tuesday July 02, 2013 @08:31AM (#5977339)
The Power of Monads!