query: What allows tail recursion to work with one stack?
positive_passages.docid: 10665
positive_passages.text: What is tail recursion?
negative_passages.docid: 156083
negative_passages.text: Recursively call a function object
negative_passages.docid: 143255
negative_passages.text: tail -f, but when the file is deleted and re-created (not appended)
negative_passages.docid: 40369
negative_passages.text: Can I Limit the depth of a Generic Stack?
negative_passages.docid: 57036
negative_passages.text: find not recursive when given a pattern on the command line
negative_passages.docid: 88686
negative_passages.text: How does the "tail" command's "-f" parameter work?
negative_passages.docid: 44331
negative_passages.text: What is the behavior of "delete" with stack objects?
negative_passages.docid: 51686
negative_passages.text: What is the first (int (*)(...))0 vtable entry in the output of g++ -fdump-class-hierarchy?
negative_passages.docid: 105788
negative_passages.text: Why is `[` a shell builtin and `[[` a shell keyword?
negative_passages.docid: 323
negative_passages.text: How to determine Stack size of a Program in linux?
negative_passages.docid: 94951
negative_passages.text: How do you iterate through every file/directory recursively in standard C++?
negative_passages.docid: 117989
negative_passages.text: "fixing recursive fault but reboot is needed" error
negative_passages.docid: 115589
negative_passages.text: Does std::stack expose iterators?
negative_passages.docid: 72446
negative_passages.text: Why are Stack and Queue implemented with an array?
negative_passages.docid: 35949
negative_passages.text: Recursion problem
negative_passages.docid: 143449
negative_passages.text: How does gcc implement stack unrolling for C++ exceptions on linux?
negative_passages.docid: 82437
negative_passages.text: How to keep count in a recursive function?