_wmd

71 ms·

691.
How to lose $172,222 a second for 45 minutes(pythonsweetness.tumblr.com)
613 points by _wmd 13y ago|236 comments
692.
by _wmd 13y ago
Unlike ZeroVM, Docker is not a security solution, it is only useful for managing administrative domains within a machine. (To preempt a massively pointless, ~20 year old conversation, Google "chroot security" and "jail securi
693.
by _wmd 13y ago
While the core subject seems fair enough, I'd expect Atwood not to be so utterly stupid by trying to swap out Apple OS X running on one of a highly restricted variety of Apple Mac hardware with a generic Windows install and expec
694.
by _wmd 13y ago
I've repeated this many times and it's never a popular idea, but here goes: it's because they retain UI/UX designers on permanent staff, when they likely have actual new work about one month in twelve, from what I gath
695.
by _wmd 13y ago
So long as the initial checkout wasn't made via https://user:password@github.com/your/repo/ URL it might not be an issue. But git doesn't warn in this case, happily writes the password you provide in pla
696.
by _wmd 13y ago
Hit refresh in your browser. :)
697.
by _wmd 13y ago
This is pretty much a blanket statement for any project of reasonable size (or even with just a sole clueless developer). But don't take my word for it, check the evidence first hand by poking around the list for yourself :) The soluti
698.
Please stop serving .git to the outside world(pythonsweetness.tumblr.com)
247 points by _wmd 13y ago|85 comments
699.
by _wmd 13y ago
It implements full text search without repeated strcmp() over half a gigabyte of strings, so search completes in reasonable time. Compare that to PyPi which does exactly what I described, and even during off peak periods, searches can somet
700.
by _wmd 14y ago
Beware MDB isn't quite as general purpose as the other options, specifically feeding it large records can cause it fall back to placing records in pages of their own, which can be wasteful on storage. It's easy to work around (by splittin
701.
by _wmd 14y ago
Yep, although I'm not sure if clustering is also a hand-triggered process in SQL Server (like it is in e.g. PostgreSQL). In any case SQLite 4.x will do it automatically.
702.
by _wmd 14y ago
Be sure to check out http://sqlite.org/src4/doc/trunk/www/design.wiki ... SQLite4 splits the SQL engine from the storage engine and provides public APIs for both, including the ability to run the SQL engine on top of any key/value store t
703.
by _wmd 14y ago
You'd hope someone is doing something about it, but it doesn't appear anyone is. I'm pretty sure a large chunk of old feeds are about to disappear for good.. the main problem is that even if archive.org were doing something about it, there
704.
Let's archive all of Google Reader(exportreader.no-ip.org)
7 points by _wmd 14y ago|3 comments
705.
by _wmd 14y ago
On PyPy it should be more efficient to have a 'class Node:', where when enough instances with similar attributes exist, it'll optimize to something like CPython `__slots__`. One issue is the list of pointers on each node. This could be kept
706.
by _wmd 14y ago
Primarily because I knew from previous research that they were easy to implement. Secondarily because unlike most trees, they're amenable to concurrent update (although this is mostly irrelevant to a Python application) and I wanted to get
707.
by _wmd 14y ago
Thanks. I've slightly improved that paragraph, although I guess it should really be mentioned in the code itself. In any case what's worthy of note is that this can be done with so little code in the first place, rather than the ugly exampl
708.
by _wmd 14y ago
This implementation may look ghastly at first sight, however it's worth note that: * The node pointer list is reused for the node structure to save memory, otherwise a minimum of 72 bytes is wasted per node on CPython, in addition to malloc
709.
by _wmd 14y ago
OrderedDict tracks insertion order , not key order . Additionally it is not possible to start iteration from an arbitrary key. The method and variable names here mostly reuse the names from the original skip lists paper, although in a rea
710.
Skip lists: fast PyPy-compatible ordered map in 89 lines of Python(pythonsweetness.tumblr.com)
77 points by _wmd 14y ago|25 comments