ch

19 ms·

241.
by ch 14y ago
Here is a very prescient comment: http://news.ycombinator.com/item?id=2977425
242.
by ch 14y ago
Well I admit it. I drank the Kool-Aid. Partly to grab my twitter handle, not that I think it was in any danger of being scooped, and partly to see just what is happening on the inside of the walled garden. I can't comment any further, my pa
243.
by ch 14y ago
I am not convinced that requiring users to become near-experts in their given compiler (and by extension their chosen platform) is a bad practice. I think it is a fine balance when writing code to find a way to express algorithms such that
244.
by ch 14y ago
With laminated woods you also have to take into account the glues used in the lamination process. While there might be some carbon-neutral glues out there, how many laminated wood products actually make use of them?
245.
by ch 14y ago
Argh! That really messes with the back-button. Otherwise its quite pretty.
246.
by ch 14y ago
That, or the radio address will once again become immensely popular.
247.
by ch 14y ago
I understand why they are offsetting the index, it just makes things somewhat unintuitive. In most programming languages A[-1] is the same as A[len(A)-1] (assuming zero based indexing) ... so in Blocky is A[0] expected to mean the same thin
248.
by ch 14y ago
Still, the blocky code reads "count with i from 0 to (get n)", but the loop generated is accessing A[0-1]..A[n-1]. JavaScript is forgiving here, but A[0..n] is not the same as A[-1..(n-1)] (at least I'm not familiar enough with JavaScript t
249.
by ch 14y ago
Interesting that in the initialization loop it sets A[0 - 1] to true, yet in your blocky code it appears to be iterating from 0 to n. In fact it always seems to be offsetting by one in array access ... 1 based indexing maybe?
250.
by ch 14y ago
That is pure gold.
251.
by ch 14y ago
I often wonder if posting messages like this actually defeats the purpose of your hiring requirements. What I mean is you have set a standard, in your case 'the Sunday test,' by which you measure a candidate. Now by letting candidates be aw
252.
by ch 15y ago
Interesting. I wonder how much power it takes to operate a machine like this.
253.
by ch 15y ago
What I don't understand about this argument, every time I see it, is how do you think Trent Reznor, Louis CK, Radiohead, etc. got to the point where they could trade on their good name? Do you think Louis CK was just sitting on his ass and
254.
by ch 15y ago
Hmm. I wonder if those are laid out on a grounded mat or just some random office table, sitting on carpet?
255.
by ch 15y ago
And here I had always thought Google Code Search was based on some kind of fancy federated radix-tree. Very nice design Russ.
256.
by ch 15y ago
This is typically why you separate authentication and authorization. In your case many authenticated users can be authorized to access a single identity.
257.
by ch 15y ago
Seems with this approach it should be easy for an admin to 'su' to a normal user account and perform actions as that user. Nice for tech support and other administrative operations.
258.
by ch 15y ago
With NFC, they could just limit the list to devices in close proximity to the point of sale. That said iPhone doesn't have NFC so they need to solve that problem some other way. The general point of scale issues still is valid, but culling
259.
by ch 15y ago
There is some simple elegance to this approach. I'm making a note of it for the next time I get stuck.
260.
by ch 15y ago
Yes, but in a code search engine it would make sense to not break words that are valid symbols in more programming languages than not. It's all about sensible defaults.
261.
by ch 15y ago
Sad to see Code Search go. I just tried a simple search for 'pthread_t' on both Koders ( http://www.koders.com ) and Krugle ( http://opensearch.krugle.org ). Both are mentioned elsewhere in the comments as possible alternatives. Krugle foun
262.
by ch 15y ago
"Ordinary citizens in the bottom 99.9% are largely not aware of these systems, do not understand how they work, are unlikely to participate in them, and have little likelihood of entering the top 0.5%, much less the top 0.1%." So how does a
263.
by ch 15y ago
While I do think these scientists are persuing a worthwhile endeavour, it does feel like the complexity of this approach is so great that it would never be useful under normal operational scenarios. Perhaps some HN submariners would like to
264.
by ch 15y ago
Why not: while( (foo = bar()) != 0 ) { /* other work */ } Or even simpler (since 'foo' serves no real purpose in the example): while( bar() ) { /* other work */ }
265.
Show HN: HTML-DOM λ-calculator(hellertime.github.com)
2 points by ch 16y ago|0 comments
266.
by ch 16y ago
Thanks for clarifying your intent, but I think the original commenter is right, there seems to be little here so far that PuSH cannot do. In fact there have been recent proposals for PuSH to gain JSON message formats (I believe superfeedr i
267.
by ch 16y ago
I really like this author's writing style. His RSS feed is unfortunately not working at the moment. Otherwise I would subscribe to his newsletter!
268.
by ch 16y ago
Very neat idea. I like the idea of aggregating all the breadcrumbs one leaves across the internet. I just dropped my email for an invite, it looks like a fun service.
269.
by ch 16y ago
Neat. It is interesting how similar this rendering is to Chris Harrison's city-to-city map: http://www.chrisharrison.net/projects/InternetMap/medium/wor...
270.
by ch 16y ago
I would be curious to see the usability of this when actually editing a buffer. Search-as-you-type would be a cool example.

More ›