过滤器还指定达到对照节点所必要的兄弟节点的数量。
The filter also specifies the number of siblings necessary to reach the comparison node.
如果不满足这些先决条件，则代码将检查新节点的父节点和它的兄弟节点是否都是红节点。
If not, the code checks whether the new node's parent and uncle are both red nodes.
位置号是必需的，以防节点有相同类型和名称的兄弟节点，这样可以表明我们引用的是哪个节点。
That position number is needed in case the node has siblings of the same type and name, to indicate which one we're referring to.
采用SAX解析器与结构连接方法，对XML文档中所有已知节点与后兄弟节点进行精确匹配并输出。
The algorithm uses Simple API for XML(SAX) parser and structural join, matches and outputs all following-sibling nodes of the given nodes.
子节点的数量在同一层上的兄弟之间可以不同，但所有“堂兄弟”的类型都是相同的。
The number of subnodes can vary between sibling nodes at the same level, but the type of all "Cousins" is identical.
您可以使用该节点树查找根元素及其所有的后代元素、属性和兄弟元素的节点。
Using that tree of nodes, you could find the node for the root element, along with all of the root element's descendants, attributes, and siblings.
目前已有的素数编码方法需要大量素数和大素数，为此提出一种改进的素数编码方法——最多亲兄弟素数，该方法不必每个节点都使用新素数。
The existing prime number labeling method needed a number of primes and some big primes, therefore, an improved prime number labeling method-most brothers prime was proposed.
在过去几十年中，石榴树节点可以大量水果在每个季度，父亲会被告知李惠珍和她的兄弟胡同的邻国发出。
The past few decades, the pomegranate tree node can be a lot of fruit in each quarter, the father will be told Hui-Zhen Li and her brothers to the alley's neighbors sent.
但在双链表的每个节点从它的兄弟姐妹和兄弟姐妹参考节点的引用。
But in doubly-linked list each node is referenced from it's sibling and the sibling references the node.
同时支持节点祖先后代关系，父子关系和兄弟关系的表示。
Moreover, LSEQ supported the representation of ancestor-descendant relationship, parent-children relationship and sibling relationship between any two nodes.
同时支持节点祖先后代关系，父子关系和兄弟关系的表示。
Moreover, LSEQ supported the representation of ancestor-descendant relationship, parent-children relationship and sibling relationship between any two nodes.
应用推荐