User context storage — Any pointer can be passed in and will be passed to all subsequent callbacks.
用户上下文存储——可以传入任何指针，并将传递给所有的后续回调。
An alternative is a data storage method called a linked list, in which each piece of data includes a "pointer" that indicates the location of the next piece.
另外一个数据存储方式叫链接，通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
Listing 6 contains a code example of declaring a state information structure and then allocating storage for the stateInfo pointer based on the size of the structure.
清单6包含的代码示例展示了如何声明一个状态信息结构，然后根据该结构的大小向stateinfo指针分配存储空间。
This optional pointer is used to allocate temporary storage where you can store information that needs to be retained between calls to and from the handler.
这个可选指针用于分配临时存储空间，以便存储对 Handlder 程序的调用和来自 Handlder 程序的调用之间需要保留的信息。
The stack is coordinated with a stack pointer that keeps track of storage and retrieval of each byte or word of information in the stack.
栈和一个栈指针配合工作，栈指针随时指示要存取的每个字或字节信息在栈中的位置。
Each node consists of two parts: one is stored data element data fields, the other is a storage next node address pointer domain.
每个结点包罗两个局部：一个是存储数据元素地数据域，另一个是存储下一个结点地址地指针域。
In order to storage the data reliably, this paper proposes storage the data pointer and its checksum redundantly.
本文采用了校验加冗余的方法对数据指针进行存储，达到了可靠存储的目的。
Since the pointer loop is the temporal pointer of storage content, a few storage unitS are enough to perform various STM task.
由于指针环路仅作为记忆内容的临时指针，因此，仅用很少的存贮单元即可完成各种短时记忆任务。
Since the pointer loop is the temporal pointer of storage content, a few storage unitS are enough to perform various STM task.
由于指针环路仅作为记忆内容的临时指针，因此，仅用很少的存贮单元即可完成各种短时记忆任务。
应用推荐