For example , the linked list of integers in the diagram above could be represented by the following node structure in c 例如,上图中的整数链表在c中可以由下面的节点结构来描述:
For example , when removing a node from a list , you have to remember to free the memory for the node structure 例如,当从一个列表中删除某个节点时,必须记住释放这个节点结构的内存。
Because node structures go in only one direction , they know nothing about the sequence of nodes that precede them 由于节点结构只指向一个方向,所以它们完全不了解它们之前的节点的顺序。
Armed with this new generic data type , you can now make a very generic list node structure , as shown in listing 4 在这个新的通用数据类型的帮助下,您现在可以得到一个非常通用的列表节点结构,如清单4所示。
With this generic list node structure , you can now define lists and list operations that work regardless of the type of data stored in them 使用这个通用的列表节点结构,您现在可以定义列表和不需要考虑存储在列表中的数据类型的列表操作。
In this paper , the structures of multi - granularity optical cross - connect in some previous works are introduced , and two kinds structure of multi - granularity optical cross - connect are proposed 在介绍现有的多粒度交换节点结构的基础上,提出了2种两层的交换结构。
They are slightly different from the node structures i showed you in c , above , because the bottom half of a pair doesn t have to be a pointer to a list node 它们与前面我向您介绍的c中的节点结构稍有不同,因为一个pair的下半部分不必是一个指向某个列表节点的指针。
A typical event - handling method retrieves node data from a data source , places the data into a node structure , and then adds the node structure to the 通常的事件处理方法会从数据源中检索节点数据,将该数据放入一个节点结构中,然后将该节点结构添加到正在被填充的节点的
These methods are easily implemented by means of allocating or de - allocating node structures , then modifying the pointers so that the given node is correctly sequenced in the list 实现这些方法很容易,只需分配或者释放( de - allocating )节点结构,然后修改指针,使给定节点在列表中正确排序即可。