STACK UNWINDING - 2013
CALL STACK
Stacks are last-in, first-out (LIFO) data structures, in other words, the last item pushed (inserted) on the stack is the first item popped (removed) from it. To understand how C++ perfo
转载
2013-10-30 11:16:43 ·
884 阅读 ·
0 评论