jacobparker

27 ms·

211.
by jacobparker 14y ago
Please explain the "joke". Why is it funny? Explain it in plain English. I want to see you type it out.
212.
by jacobparker 14y ago
The logo: http://commons.wikimedia.org/wiki/File:WWW_logo_by_Robert_Ca...
213.
by jacobparker 14y ago
You won't be able to prevent Javascript aim bots. The best you can do is server side detection of aim-bot-like behaviour, but this will always be a losing battle (better aim bots) and you may punish good players.
214.
by jacobparker 14y ago
Interesting - it seems some browsers dont have this as an exponential edge case and indeed in those yours doesn't execute exponentially (I guess I got mixed up when testing.) Anyway I dont consider it a "bug" or anything, just wanted to bri
215.
by jacobparker 14y ago
That's silly. Javascript doesn't mandate that this regular expression be slow. In fact, in Safari and Firefox on OSX this regular expression runs fine. Chrome OSX fails but I remember it running fine in Linux yesterday (but I might be wrong
216.
by jacobparker 14y ago
Regular expression: ( a * )* String: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab This kills the browser. ADDENDUM: A good read on executing regular expressions in linear (and thus predictable) time is http://swtch.com/~rsc/regexp
217.
by jacobparker 14y ago
I don't think I agree with that. Reading foreign assembly isn't that bad unless it is being intentionally obscured. It definitely takes time to decipher things but at the same time you really learn what's going on :)
218.
by jacobparker 14y ago
Well, uh, you can view that alleged 99% with a disassembler ;) (missing labels, comments, etc. though.)
219.
by jacobparker 14y ago
The common case is (probably) not that a compiler detects an instance of signed over/underflow. Instead, it can assume that this never happens and generate "dangerous" code. A good post describing how these optimizations come about is http
220.
by jacobparker 14y ago
In theory, for sure. Valgrind can test for certain kinds of undefined behaviour - it runs the code in a special virtual machine. You could also have the compiler insert checks. Obviously this isn't desirable for a lot of C projects by defau
221.
by jacobparker 14y ago
One thing he mentions is signed integer overflow. This is in the worst case equivalent to the halting problem, but even in practice very hard to test for at compile time. Another behaviour he mentions is not properly return'ing at the end o
222.
by jacobparker 14y ago
Much undefined behaviour can't be statically detected, unfortunately.
223.
by jacobparker 14y ago
I made a version for viewing in w3m (and other console-based browsers) and my phone: http://ja.cob.xxx/r/ (to get subreddits use urls like reddit. The default is http://ja.cob.xxx/r/programming+truereddit+literature ) The font is big to
224.
by jacobparker 14y ago
Floating point addition and multiplication are commutative, but are not necessarily associative.