I’ve heard Joseph’s Myers implementation is quite fast. Additionally, he has a lengthy article on Javascript optimization describing what he learned while writing his implementation. It’s a good read for anyone interested in performant javascript. http://www.webreference.com/programming/javascript/jkm3/ His MD5 implementation can be found here
There is no strict reason why a bytecode based language like C# or Java that has a JIT cannot be as fast as C++ code. However C++ code used to be significantly faster for a long time, and also today still is in many cases. This is mainly due to the more advanced JIT optimizations … Read more
Implementation of All according to ILSpy (as in I actually went and looked, rather than the “well, that method works a bit like …” I might do if we were discussing the theory rather than the impact). public static bool All<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate) { if (source == null) { throw Error.ArgumentNull(“source”); } … Read more
Note that Git 1.9/2.0 (Q1 2014) has removed that limitation. See commit 82fba2b, from Nguyễn Thái Ngọc Duy (pclouds): Now that git supports data transfer from or to a shallow clone, these limitations are not true anymore. The documentation now reads: –depth <depth>:: Create a ‘shallow’ clone with a history truncated to the specified number … Read more
I had the same problem as the original poster but the quoted answer did not solve the problem for me. The query still ran really slow from a stored procedure. I found another answer here “Parameter Sniffing”, Thanks Omnibuzz. Boils down to using “local Variables” in your stored procedure queries, but read the original for … Read more
I agree with Dietrich Epp: it’s a combination of several things that make GHC fast. First and foremost, Haskell is very high-level. This enables the compiler to perform aggressive optimisations without breaking your code. Think about SQL. Now, when I write a SELECT statement, it might look like an imperative loop, but it isn’t. It … Read more
Rico Mariani, the .NET Performance guru, had an article on this very subject. It’s not as simple as one might suspect. The basic advice is this: If your pattern looks like: x = f1(…) + f2(…) + f3(…) + f4(…) that’s one concat and it’s zippy, StringBuilder probably won’t help. If your pattern looks like: … Read more
Which is better, a or b? From a performance perspective, you’d have to measure it. (And in my opinion, if you can measure a difference, the compiler isn’t very good). From a maintenance perspective, b is better. Declare and initialize variables in the same place, in the narrowest scope possible. Don’t leave a gaping hole … Read more
What does it mean for the ranges to overlap? It means there exists some number C which is in both ranges, i.e. x1 <= C <= x2 and y1 <= C <= y2 To avoid confusion, considering the ranges are: [x1:x2] and [y1:y2] Now, if we are allowed to assume that the ranges are well-formed … Read more
Clearly the machine code the JIT compiler can generate for the first case is much more efficient. One rule that really helps there is that an object can only be unboxed to a variable that has the same type as the boxed value. That allows the JIT compiler to generate very efficient code, no value … Read more