Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
chrismcbride
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
chrismcbride
14y ago
I had the same problem, I did: au VimEnter * highlight clear SignColumn
2.
▲
by
chrismcbride
14y ago
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/
3.
▲
by
chrismcbride
14y ago
Doesn't seem that much harder http://support.godaddy.com/help/article/1091/installing-a-ru...
4.
▲
by
chrismcbride
14y ago
I believe you can set some fields to not store history https://groups.google.com/forum/#!msg/datomic/WlRM3aXwzIg/RT...
5.
▲
by
chrismcbride
14y ago
Does this mean you can no longer run xmonad or other tiling window managers with GNOME?
6.
▲
by
chrismcbride
14y ago
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
7.
▲
by
chrismcbride
14y ago
whats the monetization strategy?
8.
▲
by
chrismcbride
14y ago
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?
9.
▲
by
chrismcbride
14y ago
Conservatives don't want that stuff, republicans do
10.
▲
by
chrismcbride
14y ago
I think he means that specifically WSJ didn't publish anything about it.
11.
▲
by
chrismcbride
14y ago
I think Light Tables target is dynamic languages, which the current crop of IDEs dont have great support for.
12.
▲
by
chrismcbride
14y ago
Actually the first version was written in Java. EDIT: Also, the original crawler was written in python. http://infolab.stanford.edu/~backrub/google.html
13.
▲
by
chrismcbride
14y ago
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?
14.
▲
by
chrismcbride
14y ago
Do you have a source for that? From what I can tell its yearly releases.
15.
▲
by
chrismcbride
14y ago
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?
16.
▲
Lexical vs Dynamic scope in clojure
(info.rjmetrics.com)
61 points
by
chrismcbride
15y ago
|
5 comments