插入到樹 的英文怎麼說

中文拼音 [chārùdàoshù]
插入到樹 英文
insertion into tree
  • 插 : 動詞1. （把細長或薄的東西放進、擠入、刺進或穿入; 插上; 插進） stick in; insert 2. （中間加進去; 加進中間去） interpose; insert
  • 入 : Ⅰ動詞1 （進來或進去） enter 2 （參加） join; be admitted into; become a member of 3 （合乎） conf...
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 插入 : insert; infix; run in; break in; patch; insertion; plug in; intercalate; intercalation; intromiss...
  1. As the sun setting, the peacock fly on the tree one after another, and hide in the thick leaf inside dwell for rest, until sure of surroundings have no an excrescent circumstance, then insert the head in to the wing to fallen asleep

    夕陽西下，孔雀相繼飛到樹上，躲藏在密枝濃葉中棲息，直到確信周圍沒有異常情況時，才把頭插入肋間入睡
  2. S went and cut the strongest olive - tree he could find, stripped off its branches, inserted it in the hole, and used it as a lever. but the rock was too heavy, and too firmly wedged, to be moved by any one man, were he hercules himself

    在十分鐘的勞動之後，這道墻屈服了，露出一個可以伸進一條手臂的洞口，唐太斯砍斷了一棵他所能找到的最結實的橄欖樹，削丫枝，插入洞里，把它當撬棒用。
  3. I study mainly the storage of record and object, and bring forward the method of storage when the instance of object is embodied inside of record. 3 ) in the aspect of indexing, i presented a method that is generalized b - tree ( gbt ) and combining technique of founction template of c + + build the universal algorithm of queries, insert and delete. 4 ) finally, i analyze deeply and improve the query processing system of ormdbms, and confirm performance algorithm of linking and queries based on relational database. management system ( rdbms )

    在系統結構和特性中分析了系統所採用的兩層體系結構，並且詳細探討了在設計和實現數據庫時所涉及到的幾個主要問題：支持復雜對象、類型擴充、繼承機制和規則系統等；在存儲機制的討論中，主要研究了記錄和對象以及包含了對象實例記錄的存儲方法；在索引技術研究中，本文提出了類屬b樹的索引方法，通過c + +的函數模板技術給出了通用類屬b樹查詢、插入及其刪除的基本演算法；最後，文章以關系數據庫為基礎，深入分析並改進了在對象關系多媒體數據庫中的查詢處理系統，確定了選擇和連接操作的具體演算法。
  4. Once new nodes are created, there are several methods available to insert them into the tree

    創建新節點后，有幾個方法可用於將其插入到樹中。
  5. Method inserts the nodes into the tree recursively, prepending managers as it moves up the hierarchy

    方法遞歸地將節點插入到樹中，在層次中向上移動時不斷預設經理。
  6. So if you are inserting it into the tree, you don t have to remove it from the tree first ; that will happen automatically

    因此，如果您想將它插入到樹中，沒必要先將它從樹中移除，因為它會自動被移除。
  7. In some rare cases, this method may end up creating a new node, copying all information and inserting the new node into the tree

    在某些少見的情況下，該方法最後會創建一個新節點，復制所有信息，並將這個新節點插入到樹中。
  8. In dom level 2, renaming and moving nodes from one document to another can be relatively expensive, since these operations involve creating new nodes, copying the contents of those nodes, and inserting nodes at the appropriate places in a tree

    在dom level 2中，重命名節點和將節點從一個文檔移到另一個文檔的代價可能相當高，因為這些操作需要創建新節點，復制那些節點的內容，並將節點插入到樹中適當的位置。
  9. Then i took the pieces of cable which i had cut in the ship, and i laid them in rows one upon another, within the circle, between these two rows of stakes, up to the top, placing other stakes in the in - side, leaning against them, about two foot and a half high, like a spurr to a post, and this fence was so strong, that neither man or beast could get into it or over it : this cost me a great deal of time and labour, especially to cut the piles in the woods, bring them to the place, and drive them into the earth

    然後，我用從船上截下來的那些纜索，沿著半圓形，一層一層地堆放在兩排木樁之間，一直堆到頂上，再用一些兩英尺半高的木樁插進去支撐住纜索，彷彿柱子上的橫茶。這個籬笆十分結實牢固，不管是人還是野獸，都無法沖進來或攀越籬笆爬進來。這項工程，花了我不少時間和勞力，尤其是我得從樹林里砍下粗枝做木樁，再運到草地上，又一一把它們打入泥土，這工作尤其費力費時。
  10. Super set of iemset x ) according to constrained subtree of itemset x, if item “ a ” isn ’ t a fuzzy item, we don ’ t scan database in addition. it can be generated by ffp tree. we propose two order methods for constructing ffp tree. one is that sorting database attributes holding frequent item in ascending order of their nodes number in ffp tree. another is that sorting frequent item of not fuzzy attributes in descending order of their support firstly, then sorting database fuzzy attributes with frequent item in ascending order of their nodes number in ffp tree. our experimental results show that although fmf needs more space costly than the algorithms based on apriori, its time costly is obviously lower than the latter

    針對ffp -樹的生成，提出了兩種排序方法:按屬性順序將每個屬性下的頻繁項目依次插入到頭表中，屬性按照其在ffp -樹中可能的不同結點的個數從少到多進行排序;先對非模糊屬性下的頻繁項目按支持度從大到小進行排序，再對模糊屬性按其在ffp -樹中包含的不同結點的個數，從少到多進行排序，然後依次將各屬性下的頻繁項目插入到頭表中。
  11. The number is rounded to an integer and then converted to a string and inserted in the result tree

    數字舍入到整數，然後轉換為字元串並插入結果樹。
分享友人
分享到 Line

分享到臉書