Reputation
16,349
Top tag
Next privilege 20,000 Rep.
Access 'trusted user' tools
Badges
2 31 63
Newest
 Generalist
Impact
~499k people reached

Aug
28
comment How is it possible that facial recognition software can work, but a reCAPTCHA can't be solved by a computer
because facial recognition isn't perfect either,
Aug
28
answered Are a class's methods stored only once in memory?
Aug
28
reviewed Leave Closed Version Control Options for Shared Network Folder
Aug
28
reviewed Leave Closed Why doesn't libxml2 support XPath 2.0?
Aug
28
comment Why did GCC switch from Bison to a recursive descent parser for C++ and C?
eventually all parsers will become homebrewn after enough modifications when the parser generator can't handle the requirements
Aug
28
answered How to test generated file without hardcoding name generation logic?
Aug
28
comment Why don't compilers inline everything?
@SK-logic except that a simple if can blow the pipeline out of the water in a way that eclipses a function call
Aug
28
comment Why don't compilers inline everything?
some recursive calls can be inlined (tail calls), but all can be transformed into iteration if you optionally add a explicit stack
Aug
28
comment Multithreaded Pre/Post Functions
hint: thread local storage
Aug
27
answered Is there any danger in writing raw bytes to a file?
Aug
26
answered Is method overloading anything more than syntactic sugar?
Aug
23
comment How can I find the shortest path between two subgraphs of a larger graph?
@Pops or my first idea: a 0-cost (or uniform cost) connection to all nodes in one subgraph from the fake node, much easier :)
Aug
23
comment How can I find the shortest path between two subgraphs of a larger graph?
@Pops but that would result in the cheaper path being traversed first
Aug
23
comment How can I find the shortest path between two subgraphs of a larger graph?
It removes the complexity of the subgraphs as the first and last edge is a 0-cost from the imaginary start or to the imaginary end, then all you need to worry about is the disappearing edges
Aug
23
comment How can I find the shortest path between two subgraphs of a larger graph?
add a imaginary node that connects to all nodes of one set and use that as your starting or end point
Aug
23
answered Looking for an algorithm to connect dots - shortest route
Aug
22
comment What is the use of the prefix “for(;;);” in an Ajax response
to force a crash if it is evaled?
Aug
22
comment What is the value of a let expression
many languages use a fundamentally different setup in interactive mode than in compiled mode
Aug
21
comment Can regexp be used to check for palindromes?
No, for a regex to be able to check a language (in this case the language of palindromes) the language needs to be a regular language
Aug
21
comment Can regexp be used to check for palindromes?
@OliverWeiler but the recurse isn't available in the java regex