虚拟堆栈与实际堆栈类似,是一种后进先出(LIFO)的数据结构,可以用来临时存储函数参数和函数结果。
The virtual stack -- like a real stack -- is a last in-first out (LIFO) data structure that temporarily stores function arguments and function results.
堆栈用于按照后进先出(LIFO)的顺序存储数据。
Stacks are used for storing data accessed in Last in, First Out (LIFO) order.
这个简单的设计,可能是因为数据遵循严格的后进先出顺序,这意味着没有复杂的数据结构需要跟踪堆栈的内容-一个简单的指针的堆栈的顶部就可以了。
This simple design, possible because the data obeys strict LIFO order, means that no complex data structure is needed to track stack contents – a simple pointer to the top of the stack will do.
堆栈是一个后进先出(LIFO)队列,它保存了子例程的返回地址、数据项、指针等等。
The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, Pointers, and so on.
堆栈是一个后进先出(LIFO)队列,它保存了子例程的返回地址、数据项、指针等等。
The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, Pointers, and so on.
应用推荐