对于后一个主题，我选择实现一个并发堆栈并解释设计这种数据结构涉及的一些问题。
For the latter topic, I have chosen to implement a concurrent stack and highlight some of the issues in designing such a data structure.
正如你可能知道的那样， 堆栈 是一种数据结构，被用来以后入先出的模式增加或移除条目。
As you probably know, a stack is a data structure that is used to add and remove items in a last-in, first-out manner.
当数组用于实现诸如堆栈或环形缓冲区之类的数据结构时，会出现另一种形式的对象游离。
Another form of object loitering arises when arrays are used to implement data structures such as stacks or circular buffers.
应用推荐