pdhborges

Another site with a fixed header taking a large chunk of the screen. Seriously, what's wrong with you designers!!??

I built GCC 4.6.3 with GCC 4.2 using the LLVM backend without any problem.

You got 1/10th of the I/O performance, so you traded disk seeks for network latency?

That kind of auto completion is very easy to do. The problem is when you have references whose creation site you can't trace statically.

You must have missed this part:

"Compared to JRuby on Java 6, JRuby on Java 7 without invokedynamic is around 25% faster, and JRuby with invokedynamic is nearly 3 times faster."

Here at hacker news there seems to exist an obsession on how to hire the 10x programmers and how to build great teams.

I'm submitting this link because I'm really tired to read blog posts filled with anecdotes and making claims because some "scrum master" or whatever said so and so.

It would be nice if the author profiled the code instead of just measuring the test templates time.

You don't need ;; to terminate an expression (except when using the REPL).

Hi, what book would you recommend in alternative to e Applied Cryptography?

The contents of this article are (almost) a bunch of quotes from a bunch of different authors.

Here is the Java version:

  public boolean domainExists(String domain) {
    return Option.of((Domain) HibernateUtil.getSession().getNamedQuery("domain.findByName").setParameter("name", domain.trim().toLowerCase()).uniqueResult()).getOrElse(new Domain()).id > 0;
  }

Will the student realize that standing against the wall continually would wield the same limit?

type Ctrl-F2 and then "hi". Problem solved.

Looks like Golomb ruler to me.

for loops are also syntactic sugar and the case class matching thing

    case class Lol (a: Int, b: Int)

    Lol(2, 3) match {
       case x Lol y => x
    }

Is http://www.commendo.at/references/files/kdd08.pdf (this) the paper you are talking about?

The sum is guaranteed to fit into 128 bits

Yes, but if the object fall into the default autorelease pool you have no way to control when the memory is going to be released (at least without risking a segfault).

The runtime system might not free the memory immediately.

Imagine I have a JSONfiable protocol and I have a generic function to traverse a structure that uses the protocol to make a JSON document. It would be nice if the caller had a way to change the format.

Is it possible to implement the same protocol for a particular type in multiple ways?

C++ quicksort :|

    #include <algorithm>
    #include <iterator>
    #include <functional>
    using namespace std;
 
    template <typename T>
    void sort(T begin, T end) {
        if (begin != end) {
            T middle = partition (begin, end,   bind2nd(less<iterator_traits<T>::value_type>(), *begin));
            sort (begin, middle);
            sort (max(begin + 1, middle), end);
        }
    }

from wikipedia

Type classes or module implicits, that would be great.

Just a little not so readers don't get the wrong impression:

- imap returns an iterator, any is used to "force" the iterator run through all elements.

- the loop runs on C because of any. Instead of a for loop where jump and body are repeatedly evaluated by the interpreter, any consumes the iterator through a loop implemented in C.

Look at the source code of the C program. It uses glib and the TCL libraries and it even includes locking for the multicore benchmark.