nneonneo

132 ms·

1561.
by nneonneo 10y ago
Make's default implicit rule set is very useful for C, C++, Fortran, Pascal, and basically nothing else. Out of curiousity: how do you configure the implicit ruleset? I wasn't able to find documentation on that (the closest I foun
1562.
by nneonneo 10y ago
For anyone who's curious: you can use a ".PHONY" target to force targets to be rebuilt (i.e. that they don't correspond to real files). All dependencies of the .PHONY pseudo-target will be rebuilt unconditionally when en
1563.
by nneonneo 10y ago
For the target audience (total Make beginners) poring through autogenerated makefiles might not be such good advice. It's functionally equivalent to telling people to learn Bash by studying a `configure` script, or learning JavaScript
1564.
by nneonneo 10y ago
I hate to bring this up, but this is perhaps one of the clearest examples of PR copy as mentioned by Paul Graham's Submarine post: http://www.paulgraham.com/submarine.html Basically, this is a big advert for Yondr (the
1565.
by nneonneo 10y ago
If the user reauthenticates and you unset the reauth flag, wouldn't their previous sessions (e.g. tokens held by an attacker) suddenly become valid again? How would you prevent such an attack?
1566.
by nneonneo 10y ago
I find it truly amazing that a project with hundreds of millions of dollars at stake could have such a simple bug. After they discovered the first bug, it seems like they should have sat down to carefully audit all other places where that c
1567.
by nneonneo 10y ago
Ah, I see: the money isn't missing, it's just gone to an unknown party (the hacker) - so we're practically watching a bank heist in progress, where the "good guys" are trying to slow down the robber's getaway v
1568.
by nneonneo 10y ago
The provided link is just a page showing a bunch of transactions. For someone like me, who is not so intimate with the Ethereum terminology in use (but who is still interested in the DAO, as an observer), could someone provide a layman&#x27
1569.
by nneonneo 10y ago
Igor Skochinsky (of IDA Hex-Rays fame, among others) has been studying Intel ME for quite some time. He gave a nice talk at Breakpoint summarizing what he'd discovered (slides here [pdf]: https://github.com/skochinsky&#
1570.
by nneonneo 10y ago
Yes, you're definitely right - "serialization" as a concept is going to still be needed for data interchange. I just didn't want to mention it because that's just status quo, not part of the new computing model. In
1571.
by nneonneo 10y ago
Unicode support on filesystems is just an ugly mess, and APFS is unlikely to fix this (the brief documentation doesn't mention it at all). Let's recap: - On OS X HFS+, filenames are stored using a "variant" of NFD, where
1572.
by nneonneo 10y ago
I'm quoting from the graph in the article. The numbers are also meant to be "on the order of", since the graph only provides that level of detail - so, for example, 1ns really means "1-9ns". I believe that they are
1573.
by nneonneo 10y ago
This is a great question. One way I imagine it: Short term, the disk controller becomes a peripheral on the memory bus. On a 64-bit x86-64 system, the top 16 bits of the address are either 0000 or ffff for RAM. Make it so that the prefix 10
1574.
by nneonneo 10y ago
10ns latency means that a file entry/inode/block is available just 10-30 CPU cycles after it is requested. Suddenly the 1000 CPU cycles spent dispatching the system call look very inefficient by comparison. Obsolete might not be
1575.
by nneonneo 10y ago
To be perfectly clear: the 1000x claim isn't about throughput , but latency . The graph in the article makes this clear: spinning drives have latencies on the order of 10ms, NAND flash about 10us, and DRAM about 1ns. The claim is tha
1576.
by nneonneo 10y ago
Packages often require sudo in order to install to the global interpreter - it's a security hazard otherwise. Imagine a Python package which overrides the sys module. If it didn't require sudo, anyone could install it and compromi
1577.
by nneonneo 10y ago
"The project title has been flagged due to similarity with an existing name. Your submission has been sent for moderator review". Package managers have humans to deal with edge cases (removing malicious packages, investigating pac
1578.
by nneonneo 10y ago
The library also uses some absurdly long identifiers which are bound to clutter your code one way or another. To iterate a binary tree, use while(lfds710_btree_au_get_by_absolute_position_and_then_by_relative_position(state, &element, L
1579.
by nneonneo 10y ago
This library claims to be license-free, but some of the modules are documented otherwise. For example, the "Queue (bounded, many-producer, many-consumer)" module ( http://liblfds.org/mediawiki/index.php?title=r