Indeed, very interesting behavior. Any idea why I get I runtime error when commenting out #include <string> With MS VC++ compiler the error happens because if you do not #include <string> you won’t have operator<< defined for std::string. When the compiler tries to compile ausgabe << f.getName(); it looks for an operator<< defined for std::string. … Read more
As “there are tens of thousands of cells in the page” binding the click-event to every single cell will cause a terrible performance problem. There’s a better way to do this, that is binding a click event to the body & then finding out if the cell element was the target of the click. Like … Read more
Stack A stack, in this context, is the last in, first out buffer you place data while your program runs. Last in, first out (LIFO) means that the last thing you put in is always the first thing you get back out – if you push 2 items on the stack, ‘A’ and then ‘B’, … Read more
Starting with 2.0 a StackOverflow Exception can only be caught in the following circumstances. The CLR is being run in a hosted environment* where the host specifically allows for StackOverflow exceptions to be handled The stackoverflow exception is thrown by user code and not due to an actual stack overflow situation (Reference) *“hosted environment” as … Read more
Hmm… it works for me and with far less than 999MB of stack: > java -Xss4m Test 0 (Windows JDK 7, build 17.0-b05 client VM, and Linux JDK 6 – same version information as you posted)
It seems you’re thinking that a stackoverflow error is like a buffer overflow exception in native programs, when there is a risk of writing into memory that had not been allocated for the buffer, and thus to corrupt some other memory locations. It’s not the case at all. JVM has a given memory allocated for … Read more
No, and it never will since Guido van Rossum prefers to be able to have proper tracebacks: Tail Recursion Elimination (2009-04-22) Final Words on Tail Calls (2009-04-27) You can manually eliminate the recursion with a transformation like this: >>> def trisum(n, csum): … while True: # Change recursion to a while loop … if n … Read more
It doesn’t run forever. Each stack overflow causes the code to move to the finally block. The problem is that it will take a really, really long time. The order of time is O(2^N) where N is the maximum stack depth. Imagine the maximum depth is 5 foo() calls foo() calls foo() calls foo() calls … Read more
Parameters and local variables are allocated on the stack (with reference types, the object lives on the heap and a variable in the stack references that object on the heap). The stack typically lives at the upper end of your address space and as it is used up it heads towards the bottom of the … Read more