The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, Pointers, and so on.
堆栈是一个后进先出(LIFO)队列,它保存了子例程的返回地址、数据项、指针等等。
You could even set up a table of Pointers with the addresses of the functions of the interface, and return the address of a pointer to this table.
你甚至能够设置一个指针表,里面放置接口的函数地址,返回出来这个表的地址来用。
应用推荐