Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ob
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
1.
▲
by
ob
2y ago
Thanks for writing this. This story is rarely told correctly and you mostly got it as I remember it.
2.
▲
by
ob
2y ago
> Do you have any references supporting either that the protocol was more complicated than he demonstrated on stage BitKeeper itself is open source now and (an old version) of the protocol is documented at https://github.com&#
3.
▲
by
ob
3y ago
We at LinkedIn have been using CDE's (we call them rdev) for quite a while. We wrote about them in our engineering blog: https://engineering.linkedin.com/blog/2021/building-in-the-c... I'm happy to answe
4.
▲
by
ob
3y ago
The thing about classical music is that you have to understand the works in order to really enjoy them – of course there are exceptions when the melody just grabs you but that's not the norm. There was an album collection called "
5.
▲
by
ob
4y ago
Thanks, added.
6.
▲
by
ob
4y ago
Rust noob here but couldn't you write if let Some(element) = some_vec.first() { println!("{}", element); // .. more code } and avoid the unwrap and the empty check? Edit: Added a `let` I had forgot
7.
▲
by
ob
4y ago
This is a special case of Pratt parsing (the author wrote another article about it later on: https://www.engr.mun.ca/~theo/Misc/pratt_parsing.htm )
8.
▲
by
ob
5y ago
Author here... I wrote this after reading Yudkowsky's article (linked in mine) and had the example posted there in mind as I went through the article. This was many years ago and I too wish I had picked something more upbeat. :-(
9.
▲
by
ob
6y ago
No, that is the LinkedIn app. It's the messaging dialog (you can see their custom "send" button at the lower right corner).
10.
▲
by
ob
9y ago
Or in the words of John Maynard Keynes: "In the long run, we're all dead". Which means that fixing things "in the long run" is not ideal.
11.
▲
by
ob
10y ago
The main problem is performance, it takes long enough to train a regular deep learning AI, let along a homomorphically encrypted one.
12.
▲
by
ob
10y ago
I still think one of the best textbooks on economics is Paul Samuelson's Economics. Assuming you mean macro-economics that is.
13.
▲
by
ob
10y ago
> Has you ever wanted to combine the speed and safety of Bash with the raw, unbridled power of C? Uh, no? :)
14.
▲
by
ob
10y ago
And that is exactly why people love Elm: > "foo" "bar" -- TYPE MISMATCH --------------------------------------------- repl-temp-000.elm You are giving an argument to something that is not a function! 3
15.
▲
by
ob
10y ago
> In one week in May, she earned $604 for 28 hours of work I wonder if they count "hours of work" as hours with a passenger or as total hours driven. If the latter then she actually "worked" longer hours.
16.
▲
by
ob
10y ago
True, but they could set the threshold higher. Like for instance have it match for both name, last name, and company. There is a tradeoff between accuracy and relevance and that can be tweaked.
17.
▲
by
ob
10y ago
Sounds like equivalent representations no? Limit the scope of the I lines or wrap them in D lines.
18.
▲
by
ob
10y ago
The BAM server is part of the open source version. The 90-day trial is for the enterprise version (which is the same version, only with commercial support). BitKeeper doesn't support locking binary files.
19.
▲
by
ob
10y ago
Yeah, we're trying to figure out how to do that.
20.
▲
by
ob
10y ago
We have a git importer but it's not part of the "official" repo as there are still a few corner cases. I am afraid we don't have a mercurial importer though...
21.
▲
by
ob
10y ago
I assume they mean this: https://en.wikipedia.org/wiki/Fiber_(computer_science)
22.
▲
by
ob
10y ago
That was actually the original prototype. Little has moved on to have a pointer object type.
23.
▲
by
ob
11y ago
He means the author of the book, not the programming language.
24.
▲
by
ob
14y ago
I learned emacs first and became reasonably proficient in it. Some years ago, I joined a company where most people used vi. I saw it as an opportunity to use vi (also vim) and I already knew a bit of vi from editing unix config files. I spe
25.
▲
by
ob
14y ago
> Honest question: how would you measure an L2 cache lookup? Like this: https://github.com/ob/cache/blob/master/cache.c
26.
▲
by
ob
15y ago
> OP is saying something like "when I cook things with my freezer they don't get hot." It's that non-sensical. No, OP is saying "when I cook my food in the microwave for 3 minutes, I get it to a very different temperature than if I co
27.
▲
by
ob
15y ago
Which he lost... i.e. Linus paid no attention to what Bram said ;)
28.
▲
by
ob
15y ago
You need to do criss-cross merges that revert previous commits on one or both sides of the merges. If you're not reverting you're not hitting Bram's corners. This is a though corner case and I'm pretty sure you can confuse any source cont
29.
▲
by
ob
15y ago
Yeah, the website is awfully outdated and information free. BitMover is working on it. One example that bk gets right and git doesn't is precisely the one explained in the article.
30.
▲
by
ob
15y ago
You're wrong, but unfortunately I'm not at liberty to describe how bk does merges... it's part of the "secret sauce". i am truley sorry for your lots...
More ›