chrismcbride

I had the same problem, I did:

au VimEnter * highlight clear SignColumn

The second one is a timing issue. You need to have an equality method that takes an equal amount of time on success or failure.

Heres a good read on timing attacks in general: http://codahale.com/a-lesson-in-timing-attacks/

Doesn't seem that much harder http://support.godaddy.com/help/article/1091/installing-a-ru...

I believe you can set some fields to not store history

https://groups.google.com/forum/#!msg/datomic/WlRM3aXwzIg/RT...

Does this mean you can no longer run xmonad or other tiling window managers with GNOME?

Between the firms fighting its zero-sum. Everyone spends a lot of money acquiring a large patent portfolio for defense. No one wins or loses. But overall it is a misallocation of capital. All that money and human resources could be spent on further innovation.

whats the monetization strategy?

I might be reading this wrong, but from the slides it seems like JOINs are only fast when they are on the same machine. Their own ORM library avoids using JOINs all together. Doesn't that defeat the point of using an RDBMS?

Conservatives don't want that stuff, republicans do

I think he means that specifically WSJ didn't publish anything about it.

I think Light Tables target is dynamic languages, which the current crop of IDEs dont have great support for.

Actually the first version was written in Java. EDIT: Also, the original crawler was written in python. http://infolab.stanford.edu/~backrub/google.html

1) What is the benefit of recalculated on every reduce? Is this so you can use side-effects?

2) If seq or first is called on a reducible, wouldn't it be easy to just implicitly realize the reducible in to a sequence first?

Do you have a source for that? From what I can tell its yearly releases.

Well besides the implicit parallelism of fold, wouldn't this be generally useful to reduce intermediate list creation? Or do lazy-seqs already solve that problem?