Re:Billion laughs
by sltkr on Sunday October 21, 2012 @10:04AM
(#4679723)
That's hardly a fool-proof solution, because you still end up with a document that's has a very large logical size (even if you represent it in a very compact way in memory) and any non-trivial operation on the resulting string that needs to evaluate it on a character-by-character basis (e.g. a substring search) will still take "forever" to complete.
[ Parent
| on HN ]
There are no comments on this comment yet.