这两个数据指针之间，有4个字节的间隔。
程序启动前TEB便被初始化并且含有线程重定位数据指针。
The TEB is prepared during application start up and contain Pointers to thread related additional data.
这两行中的数据指针和前面指向A 的数据指针是同样的方式。
The pointers in these two lines are pointing to B in the same fashion as the two previous were pointing at A.
当值为null时，数据指针就完全不占用空间，就像这个列不存在一样。
When null, the data point takes up no space just as if the column didn’t exist.
本文采用了校验加冗余的方法对数据指针进行存储，达到了可靠存储的目的。
In order to storage the data reliably, this paper proposes storage the data pointer and its checksum redundantly.
语义缓存由互不相交的语义区域组成，每一个语义区域包括语义描述及其数据指针。
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.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用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.
如果既没有根也没有指针指向链表，那么你的数据就丢失在内存中了。
If there is no root or a pointer pointing to any part of the list then your data is lost in memory.
返回指向静态数据的指针可能会导致函数不可重入。
Returning a pointer to static data may cause a function to be non-reentrant.
在内部，相关数据通过指针被拷贝到动态分贝的内存上。
Internally the data referenced by the pointer is copied into dynamically allocated memory.
如果函数需要在一系列调用期间维持某些数据的状态，比如工作缓存或指针，那么调用者应该提供此数据。
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.
索引是用来定位数据页的顺序指针或键的集合。
Indexes are collections of sequentially ordered Pointers or keys used for locating data pages.
如果要传递数组或指针，那么最好小心错误和坏数据的出现。
If you are passing arrays or Pointers, then you REALLY better be watching for errors or bad data.
接下来我们将了解更多有关使用指针和查询来筛选数据的方法。
We will see more about using cursors and queries to filter data next.
是持有有关SPE程序本身的数据的结构的指针。
This is a pointer to a structure which holds the data about the SPE program itself.
这种简单的设计，很有可能是考虑到数据操作都符合后进先出（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.
另外一个数据存储方式叫链接，通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
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.
是的，我们分配了指针y，但是,没有指向任何数据。
Yeah. We allocated the pointer y but we never set it to point to a pointee.
这和需要你猜测某个内存片包含对象指针和一些类似对象指针的随即数据的老式GC系统有鲜明的对比。
This is in contrast with conservative GC systems which requires you to guess whether some piece of memory contains an object pointer or just some random data that resembles an object pointer.
执行fork之后，父进程和子进程获得打开的所有文件描述符和数据值的拷贝，所以指针对于它们都是有效的。
After the fork, the parent and child have copies of all open file descriptors and data values, so the pointer works for both.
引入了一个叫做seqlock的新类型的锁，用于锁定小段的经常被访问的数据(不是指针)。
A new type of lock called seqlock has been introduced for locking a small section of data (no Pointers) that is frequently accessed.
应该在Handlder 程序OPEN例程中完成的第一件事是设置IOInformationFeedback数据结构的指针和长度。
The first thing that should be done in the handler OPEN routine is to set the pointers and lengths of the IO Information Feedback data structures.
DataObjectPtr实际上是包含指向数据对象的指针的包装类。
A DataObjectPtr is really a wrapper class holding a pointer to the DataObject.
不返回指向静态数据的指针；所有数据都由函数的调用者提供。
Does not return a pointer to static data; all data is provided by the caller of the function?
描述二叉树(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.
编程基础（变量，数据类型，引用，指针，作用域，错误处理，迭代，核心算法-搜索，排序等）
The basics of Programming (variables, data types, references, pointers, scope, error handling, iteration, core algorithms - searching, sorting, etc.)
那么，你怎样分配一个指针数据？
这样允许您创建一个任意复杂的数据结构，并将它作为一个指针传送给需要在这个数据结构上进行操作的线程。
This allows you to create an arbitrarily complicated data structure for the thread to work on, and pass it in as a single pointer.
这样允许您创建一个任意复杂的数据结构，并将它作为一个指针传送给需要在这个数据结构上进行操作的线程。
This allows you to create an arbitrarily complicated data structure for the thread to work on, and pass it in as a single pointer.
应用推荐