children node 中文意思是什麼

children node 解釋
子女節點
  • children : child 的復數。children of iniquily 歹人。 children of Israel 猶太人。 children of Izaak Walton 愛釣魚的人們。
  • node : n 1 節；結；瘤；【蟲類】結脈。2 【植物；植物學】莖節；【醫學】硬結腫；結，節結；【天文學】交點。3...
  1. The appendchild ( ) method appends a new child node to the end of the list of children of a node

    方法的作用是：在指定節點的最後一個子節點列表之後添加一個新的子節點。
  2. A root node is copied by copying its children

    根節點通過復制其子級進行復制。
  3. Of elements whose text node children should be output using cdata sections

    指定文本節點子級應使用cdata節輸出的元素的
  4. That means they visit the children of a given non - leaf node before visiting the node itself

    這意味著它們在訪問給定的（非葉）節點本身之前，先訪問它的子節點。
  5. The batch algorithm in this paper reduces the redundant computation in each node for generating its children by the presented definition of expansion - equivalence class, thereby improves the algorithm ? efficiency

    而本文中批生成演算法通過提出的擴展等價類這一概念來有效地減少了在每個節點處計算其子節點的冗餘計算量，從而達到提高演算法效率的目的。
  6. Saves the children of the node to the specified

    將節點的子級保存到指定的
  7. Saves all the children of the node to the specified

    將節點的所有子級都保存到指定的
  8. If the selected node has no children, this property returns a nodelist containing no nodes

    如果以選擇的節點不包含子節點，那麼這個屬性返回部包含任何節點的節點列表。
  9. Collection is " live " ; that is, changes to the children of the node object that it was created from are immediately reflected in the nodes returned by the

    集合為「活動」的；也就是說，對其源節點對象的子級所做的更改會立即反映在由
  10. If they are both red nodes, the prerequisite " if a node is red, then both its children are black " is not met, so both its parent and its uncle are marked as black, and the new nodes parent s parent is marked as red

    如果它們都是紅節點，則不滿足「如果節點為紅，則其兩個子節點都為黑」的先決條件，所以將其父節點和它的兄弟節點都標記為黑，同時將新節點的父節點的父節點標記為紅。
  11. This paper analysis three kinds of deformations and propose resolving method respectively. a bottom - up updating method is propose especially which can compute the bounding volume of parent node through bounding volumes of the two children by k comparison. furthermore, a traverse tracing strategy that can speed up collision detection is proposed in this paper based on developing and utilizing temporal - spatial coherence in virtual environment

    本文在對幾種變形情況進行分析的基礎上，分別提出了相應的解決方法，並著重提出了一種自底向上的包圍盒樹快速更新演算法，通過k次比較運算由子結點的包圍盒得到父結點的包圍盒，以解決拉壓變形和拓撲變化后包圍盒樹的更新問題。
分享友人
分享到 Line

分享到臉書