Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Chirono
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
61.
▲
by
Chirono
10y ago
Don't know why you are being down voted. Even if you are incorrect, it would be interesting to hear why. Anyone care to comment?
62.
▲
by
Chirono
12y ago
Really nice idea, but it seems like quite a reliable way to win is to fill all the squares in red, and then change all the places it tells you are wrong. Perhaps rather than pointing out which cells are wrong, highlight the group/row&#
63.
▲
Hacks! An investigation into the million-dollar business of video game cheating
(pcgamer.com)
2 points
by
Chirono
12y ago
|
0 comments
64.
▲
by
Chirono
12y ago
Wait, they've got rid of unique pointers? When did that happen? They were there a couple of months ago. That was one of my favourite language features...
65.
▲
by
Chirono
13y ago
On the backend, Hacker News runs on one core, and Graham calls this a “remarkable feat of scaling.” Wow, Really? I'd say that is pretty remarkable, yes. Is there anywhere that goes into more detail about this?
66.
▲
by
Chirono
14y ago
I find this comment interesting given the recent (ok, continuous) talk about not using maths puzzles in programmer interviews. This is perhaps an interesting real-world case that demonstrates how a mathematical outlook leads to much cleaner
67.
▲
by
Chirono
14y ago
Instead of failing with an error at compile time, it will emit code that, if run, will fail with a 'type error' at run time.
68.
▲
by
Chirono
14y ago
Hmmm, you're probably right. I had in mind something like GenStgExpr[1] that make up the STG type in GHC. I'd imagine with all the optimisations, serialization and code-gen that is based directly off that data structure, any significant ch
69.
▲
by
Chirono
14y ago
Sure, for small programs, that's probably a better approach. But this could really come in handy when your program is split across 100 files and you change a central data type. Now you can update and test in batches without having to refact
70.
▲
by
Chirono
14y ago
Actually, GHC has been using GIT for about a year now. There was a lot of discussion but darcs has (mostly) been dropped. There are a few libraries that are still darcs-controlled but generally because nobody has got round to migrating them
71.
▲
by
Chirono
14y ago
Regarding 2: You're correct, the main order book is public and usually anonymous. There are also non-public books called dark pools where you cannot see what other people are bidding. You are also correct in supposing that a lot of meta-gam
72.
▲
by
Chirono
15y ago
Its never been legit for such burglars to gain access to a building and leave a note describing the poor security on the CEO's desk. Unless, of course, you happen to be Richard Feynman. Which most of us aren't. http://www.silvertra
73.
▲
by
Chirono
15y ago
Care to elaborate on that? I'm fairly entry-level when it comes to vim and I'd be interested to hear some good examples of what it can do over something like sublime.
74.
▲
by
Chirono
15y ago
Use enums for your op codes, and a switch statement (depends on compiler). If you use enums and a switch, the compiler can generate a jump table because it knows the enum will always be in a certain range. Much better performance than
75.
▲
by
Chirono
15y ago
Thanks, uniqueness typing has been a bit of a hobby of mine for a few years, so I'm familiar with 1 & 2. Uniqueness in system-level languages, however, is not something I know so much about, so something like 3 is pretty interesting.
76.
▲
by
Chirono
15y ago
Do you know if there is any explanation of 'unique pointers' and 'unique closures' anywhere? I'm quite interested to see some of the decisions, especially wrt the type-system.
77.
▲
by
Chirono
15y ago
There is a (fairly) simple proof of that, however. You may well be aware of this already, but in case someone hasn't seen it before: Each comparison of objects provides one bit of information. So k comparisons provide k bits of inform
78.
▲
by
Chirono
15y ago
This is a great idea. Imagine a film-making business with the same allure for arts graduates that Google etc have for comp sci graduates. Like you say, being payed $30K+ straight out of film school is quite attractive, especially if it's at
79.
▲
by
Chirono
15y ago
As long as it was also possible to do some non-dumb things, of course...
80.
▲
by
Chirono
15y ago
| I wonder how much the in-house expertise of developing Chrome is contributing to the GoogleBot analysis stuff If anything, I expect the contribution worked the other way, with the rendering engine being developed purely for search
81.
▲
by
Chirono
15y ago
Also, you probably mean "wrath of a thousand pedants" not "wraith".
82.
▲
by
Chirono
15y ago
Anyone know of an easy way to simulate a slow bandwidth connection? There was some talk a while ago about an app called slowy that does just this. https://news.ycombinator.com/item?id=3294687
83.
▲
by
Chirono
15y ago
Try changing line 120 to echo -e $"$(print_tick $number)\c" And it should work fine.
84.
▲
by
Chirono
15y ago
That /was/ coming from the plasma speaker.
85.
▲
John Carmack interview about the future of graphics technology
(pcgamer.com)
2 points
by
Chirono
15y ago
|
0 comments
86.
▲
How to Design Small Decision Making Groups
(intuitor.com)
2 points
by
Chirono
15y ago
|
0 comments
87.
▲
by
Chirono
15y ago
Your website mentions low-latency-execution; how well have you found Haskell can cope with this? Have you run into problems with GC pauses etc? From my experience, major GC collection can be quite large and can't really be avoided...
88.
▲
by
Chirono
15y ago
Take a look here: http://www.haskell.org/haskellwiki/Haskell_in_industry There are a number of banks mentioned such as Bank of America, Barclays Capital and Cedit Suisse. A company called Allston Trading is apparently using Haskell to do
89.
▲
by
Chirono
15y ago
The common trait I've seen in all exceptional programmers is an ability to keep a tremendous number of details in memory at one time Would you care to elaborate on this? I'm a programmer with 'precise and mathematical mind' and I
90.
▲
by
Chirono
15y ago
There is an implementation of exact real arithmetic that has been verified in in Coq[1] and also an implementation in Haskell[2] which may or may not do what you want to do. It really does depend on what you want to compute. For instance,
More ›