这两个数据指针之间，有4个字节的间隔。
也就是说，它会在对象销毁时删除数据指针。
That is, it will delete the Pointers of data at the object destruction.
数据指针值无效。
数据指针寄存器；
语义缓存由互不相交的语义区域组成，每一个语义区域包括语义描述及其数据指针。
The semantic cache consists of disjoint semantic regions, and each semantic region includes a description and a corresponding data pointer.
两个数据指针(41、43)与特殊功能寄存器相结合导致四个有效快速参考位置。
Two data Pointers (41, 43) in conjunction with the special function register result in four effective quick reference locations.
返回指向静态数据的指针可能会导致函数不可重入。
Returning a pointer to static data may cause a function to be non-reentrant.
是持有有关SPE程序本身的数据的结构的指针。
This is a pointer to a structure which holds the data about the SPE program itself.
引入了一个叫做seqlock的新类型的锁，用于锁定小段的经常被访问的数据(不是指针)。
A new type of lock called seqlock has been introduced for locking a small section of data (no Pointers) that is frequently accessed.
索引是用来定位数据页的顺序指针或键的集合。
Indexes are collections of sequentially ordered Pointers or keys used for locating data pages.
基指针引用进程的数据段，而且永远是特定于进程的。
Base Pointers refer to data sections of the process, and are always process specific.
编程基础（变量，数据类型，引用，指针，作用域，错误处理，迭代，核心算法-搜索，排序等）
The basics of Programming (variables, data types, references, pointers, scope, error handling, iteration, core algorithms - searching, sorting, etc.)
列表3.更新新的行指针，并返回测试数据。
执行fork之后，父进程和子进程获得打开的所有文件描述符和数据值的拷贝，所以指针对于它们都是有效的。
After the fork, the parent and child have copies of all open file descriptors and data values, so the pointer works for both.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
在调试信号时，需要查看的一些重要寄存器包括GPR、指令指针(NIP)、机器状态寄存器(MSR)、Trap、数据地址寄存器(DAR)等等。
Important registers to look for when debugging through signals are the GPRs, instruction pointer (NIP), machine state register (MSR), trap, data address register (DAR), and so on.
这样您就拥有了一个struct，其中第一个元素为数据条目，第二个元素为指向下一个节点的指针。
Here you have a struct that includes the first element as a data item and the second element as a pointer to the next node.
索引是包含指向数据的指针的物理结构。
An index is a physical structure containing Pointers to the data.
如果要传递数组或指针，那么最好小心错误和坏数据的出现。
If you are passing arrays or Pointers, then you REALLY better be watching for errors or bad data.
dxferp：指向数据传输时长度至少为dxfer_len字节的用户内存的指针。
Dxferp: a pointer to user memory of at least dxfer_len bytes in length for data transfer.
是到此程序的环境数据的指针。
DataObjectPtr实际上是包含指向数据对象的指针的包装类。
A DataObjectPtr is really a wrapper class holding a pointer to the DataObject.
另外一个数据存储方式叫链接，通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
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.
指向脱离函数需要的输入数据结构的指针。
LpszInData Points to the input data structure required for this escape.
接下来我们将了解更多有关使用指针和查询来筛选数据的方法。
We will see more about using cursors and queries to filter data next.
描述二叉树(binarytree)的节点有一个数据值、一个左指针和一个右指针；不过，很多数据体要求树不只有一个左分支和一个右分支。
Binary trees are represented by nodes that have a data value and a left and right pointer; however, there are many data structures that require trees with more than just a left and right branch.
不返回指向静态数据的指针；所有数据都由函数的调用者提供。
Does not return a pointer to static data; all data is provided by the caller of the function?
如果函数需要在一系列调用期间维持某些数据的状态，比如工作缓存或指针，那么调用者应该提供此数据。
If a function needs to maintain the state of some data over successive calls, such as a working buffer or a pointer, the caller should provide this data.
这种简单的设计，很有可能是考虑到数据操作都符合后进先出（LIFO ）规则，这意味着访问栈的内容并不需要复杂的数据结构，一个简单的栈顶指针就能搞定一切。
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.
数据标识和指向该数据的指针作为cookie存储在客户机上。
An ID or pointer to that data is stored on the client as a cookie.
应用推荐