node list 中文意思是什麼

node list 解釋
節點表
  • node : n 1 節；結；瘤；【蟲類】結脈。2 【植物；植物學】莖節；【醫學】硬結腫；結，節結；【天文學】交點。3...
  • list : n 1 清單，目錄，表，一覽表；名單。2 （交易所中）全部上市證券。3 ＝listprice an active list現役軍...
  1. An expression that is evaluated with the specified node as the current node, and with the complete list of nodes being processed in unsorted order as the current node - list

    將指定節點作為當前節點並將未排序進行處理的完整節點列表作為當前節點列表計算的表達式。
  2. The appendchild ( ) method appends a new child node to the end of the list of children of a node

    方法的作用是：在指定節點的最後一個子節點列表之後添加一個新的子節點。
  3. The following tables list by server explorer node the categories of data sources that administrators and typical users on local and remote computers can explore and create

    下表按服務器資源管理器節點列出了本地和遠程計算機上的管理員和典型用戶可以瀏覽和創建的數據源類別。
  4. The following is a list of node types that can have child nodes

    以下是可以有子節點的節點類型列表。
  5. Gets or sets the image list index value of the image that is displayed when a tree node is selected

    獲取或設置當樹節點選定時所顯示的圖像的圖像列表索引值。從
  6. Gets or sets the image list index value of the image displayed when the tree node is in the unselected state

    獲取或設置當樹節點處于未選定狀態時所顯示圖像的圖像列表索引值。
  7. Gets or sets the image list index value of the image that is displayed when the tree node is in the selected state

    獲取或設置當樹節點處于選定狀態時所顯示的圖像的圖像列表索引值。從
  8. Is defined as an xml schema list data type, the node value is exposed as an array of objects

    被定義為xml架構列表數據類型，則此節點值將作為對象數組進行公開。
  9. Is defined as an xml schema list data type, then the node value is exposed as an array of objects

    定義為xml架構列表數據類型，則此節點值將作為對象數組進行公開。
  10. The core algorithms in the candidate set creating function module are code pretreatment algorithm and candidate set creating algorithm. candidate list creating function module is the most important module, its core algorithms include candidate list adjusting algorithm, candidate matrix creating algorithm, original word lattice creating algorithm, language element node creating algorithm, optimal candidate words searching algorithm and candidate list creating without code algorithm which

    候選列表生成模塊是整個系統最主要的模塊，主要核心演算法包括候選字詞調整演算法、候選矩陣生成演算法、初步詞網格生成演算法、語言元素結點的生成演算法、尋找最佳語句候選演算法以及無編碼候選列生成演算法，無編碼候選列生成演算法利用對用戶已輸入的漢字進行切分標注，通過系統中的知識庫信息在沒有輸入編碼的情況下預測后續的輸入。
  11. Alternatively, an event in one component may update the visual representation of another component ; for example, clicking on a leaf node in a tree may cause an associated list to change its contents and redisplay

    另外，某個組件的事件可能會更新另一個組件的顯示；例如當點擊一個樹型控制項的葉節點可能會導致和它關聯的列表控制項改變它的內容和顯示。
  12. Reference counting is simple, lends itself well to incremental collection, and the collection process tends to have good locality of reference, but it is rarely used in production garbage collectors for a number of reasons, such as its inability to reclaim unreachable cyclic structures objects that reference each other directly or indirectly, like a circularly linked list or a tree that contains back - pointers to the parent node

    引用計數很簡單，很適用於增量收集，收集過程一般會得到好的引用區域性，但是出於幾個理由，它很少在生產垃圾收集器中使用，如它不能回收不可到達的循環結構（彼此直接或者間接引用的幾個對象，如循環鏈接的列表或者包含指向父節點的反向指針的樹） 。
  13. In the network, the input node is 64, the middle is 20 and the output is 4. we also use matlab train and simulate the designed network. finally, we designed software, which combines all the correlate theory and method list above to validate the thinking

    神經網路在漢字識別中的應用包括研bp神經網路及其改進演算法、設計漢字識別所需要的bp神經網路，即在神經網路的輸入層、中間層、隱含層採用64 ? 20 ? 4的結構，並利用matlab6 . 5對所設計方案進行模擬和驗證。
  14. To avoid confusion, it might be worthwhile to draw out each list node

    為了避免混淆，可能有必要列印出每一個列表節點。
  15. Bulk operations on a ttreeview are often painfully slow, because every time a node is referenced using an index, the ttreeview has to walk through its linked list of nodes to get to the specified index

    對一個樹開視圖控制項進行大量操作經常速度很慢，因為每一次節點都需要通過一個索引進行引用，樹形視圖控制項必須遍歷它的節點鏈表以獲到特定的索引，這個例子演示了一種解決這一問題的方法。
  16. How to rapidly stream ttreeview contents - bulk operations on a ttreeview are often painfully slow, because every time a node is referenced using an index, the ttreeview has to walk through its linked list of nodes to get to the specified index

    對一個樹開視圖控制項進行大量操作經常速度很慢，因為每一次節點都需要通過一個索引進行引用，樹形視圖控制項必須遍歷它的節點鏈表以獲到特定的索引，這個例子演示了一種解決這一問題的方法。
  17. To expand a node selected in the list, click its plus sign or press the plus key on the keypad

    若要展開列表中選定的節點，請單擊該節點的加號（ + ）或按數字小鍵盤上的加號（ + ）鍵。
  18. What if i want to insert after a reference node or prepend a child node make the new node first in the list

    假如我想在一個參考節點後面插入或者由前新增（ prepend ）一個子節點（使新節點位於列表中的第一位） ，我該怎麼做呢？
  19. For example, when removing a node from a list, you have to remember to free the memory for the node structure

    例如，當從一個列表中刪除某個節點時，必須記住釋放這個節點結構的內存。
  20. When you know the length of a node list, you can easily loop through it and extract the values you want

    當你知道了一個節點列表的長度時，你可以非常方便的對它執行循環語句並從中提取你想要的值。
分享友人
分享到 Line

分享到臉書