judofyr

43 ms·

421.
by judofyr 12y ago
Where's the unreachable code in the first example? All the lines seems reachable to me.
422.
by judofyr 12y ago
> - "Unlike reading from the /dev/urandom" -> author meant /dev/random Pretty sure he doesn't. He's describing the differences between using the /dev/urandom pool (through getrandom(
423.
by judofyr 12y ago
Well, LightTable was inspired by Bret Victor's ideas. He worked at Apple earlier.
424.
by judofyr 12y ago
Wrong language.
425.
by judofyr 12y ago
Permalink in case they change it: https://github.com/DataDog/dd-agent/blob/f911dd8955dd13aae1d...
426.
by judofyr 12y ago
I'm not sure how much there is to discuss unless you want to challenge all of the proofs at http://en.wikipedia.org/wiki/0.999 .
427.
by judofyr 13y ago
Another way to think about it: He had the numbers 100, 3, 6, 25, 50, 75. 25, 50 and 75 are big and difficult to work with, but 50/25=2 and 75/25=3 are far easier. He could either do it right away, but that gives him either (2 and
428.
by judofyr 13y ago
"click here english translation": http://gwei.org/pages/google/legalletter_e.html
429.
by judofyr 13y ago
If you want something simpler: now() { echo $(date "+%Y-%m-%d %H:%M:%S") - "$@" >> $HOME/.now } Usage: now "Working on Project A" now pause now continue now done
430.
by judofyr 13y ago
> A big problem with Bayesian statistics (as I see it) it that it not always possible to have any sense of what the prior probability is. Reminds me of this quote: (These values are known as priors, which is ironic because Bayesians ine
431.
by judofyr 13y ago
A conservative GC will look for memory addresses on the stack/heap and assume they're all references to objects. This means that if you have an pointer-like value (e.g. an integer in the same range as where your objects are stored
432.
by judofyr 13y ago
Just FYI (and anyone else listening): this is called "dog-piling" if you want to look around for solutions: http://en.wikipedia.org/wiki/Cache_stampede
433.
by judofyr 13y ago
Quoting ko1 ( https://bugs.ruby-lang.org/issues/8339#note-11 ): > Parallel tracing needs an assumption that "do not move (free) memory > area except sweeping timing". Current CRuby does. &gt
434.
by judofyr 13y ago
Have you considered pluggable backends (with a Sidekiq/Resque/Rediss backend) so you can easily upgrade a Sidekiq stack to Sneakers?
435.
by judofyr 13y ago
You can upload binaries to releases on GitHub: https://github.com/Atarity/Lightpack/releases/tag/5.10.4
436.
by judofyr 13y ago
Earlier discussion: https://news.ycombinator.com/item?id=5545816
437.
by judofyr 13y ago
You forgot the "l": "noe\u{0308}" # => "noë"
438.
by judofyr 13y ago
This is the test case: https://eval.in/73766 print(len("noe\u0308l"))
439.
by judofyr 13y ago
The Unicode standard includes uppercase rules. If you're already representing strings using Unicode codepoints, why not follow the whole Unicode standard? EDIT: And yes, different languages can have different uppercasing rules. There&#
440.
by judofyr 13y ago
"noe\u0308l".size # => 5 ruby 2.0.0p247 (2013-06-27 revision 41674) [x86_64-darwin13.0.0]
441.
by judofyr 13y ago
In many languages it's difficult fixing the string type without breaking existing code. In Ruby: String#upcase only handles ASCII (by spec), #length counts codepoints, #reverse reverses codepoints. You can use UnicodeUtils if you need
442.
by judofyr 13y ago
Wouldn't it be better to make NPM more distributed so that anyone could set up a mirror and help out? EDIT: Not saying it would be easy; I'm just wondering if you've considered this direction.
443.
by judofyr 13y ago
They've even mentioned it on their blog: http://blog.quora.com/Making-Sharing-Better > Open any Quora URL. If you come across a Quora link anywhere and you want to read it without being asked to join Quora, you can
444.
by judofyr 13y ago
Think about it like this: Using a SHA256 + global salt is nothing different from using SHA256 with a different set of constants/initial values.
445.
by judofyr 13y ago
This is a common misconception, but a "global salt" isn't actually a salt. Not sure what a "basic salt" is though. > A new salt is randomly generated for each password. In a typical setting, the salt and the pass
446.
by judofyr 13y ago
Another way (using flip-flops): a=b=c=(1..100).each do |num| print num, ?\r, ("Fizz" unless (a = !a) .. (a = !a)), ("Buzz" unless (b = !b) ... !((c = !c) .. (c = !c))), ?\n end
447.
by judofyr 13y ago
Paid products gets cancelled as well.
448.
by judofyr 13y ago
See also: HAT-trie by Askitis and Sinha. Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-chains into buckets. T
449.
by judofyr 13y ago
> Another new concept is the ability for either side to push data over an established connection. While the concept itself is hardly revolutionary — this is after all how TCP itself functions – bringing this capability to the widespread
450.
How to deal with negativity on Twitter(tail-f.org)
32 points by judofyr 13y ago|20 comments

More ›