Examples with "tree data structure" and their translation in Japans
We konden deze vermelding niet vinden. Er worden benaderende resultaten weergegeven. Controleer je spelling of stel voor deze term aan het woordenboek toe te voegen.
A dynamic memory management device comprising: a heap holding unit (11) that holds a heap expressing, in a tree data structure, a set of rectangular area information indicating the size of available rectangular areas among free areas in a memory area (1); a rectangular size input unit (13) that inputs the rectangular size of an area that needs to be reserved; a rectangular area search unit (14) that searches for a rectangular area among the free areas in the memory area (1) having a size larger than the rectangular size entered by the rectangular size input unit (13), by executing a binary search of the heap held by the heap holding unit (11), and outputs coordinates indicating that rectangular area; and a heap refresh unit (15) that refreshes the heap held by the heap holding unit (11), if a rectangular area was found by the rectangular area search unit (14).
You can construct TreeView using any tree data structure you prefer.
ツリービューは任意の木構造のデータを使用して作成できます。
The original linear time recognition algorithm of Booth & Lueker (1976) is based on their complex PQ tree data structure, but Habib et al. (2000) showed how to solve the problem more simply using lexicographic breadth-first search, based on the fact that a graph is an interval graph if and only if it is chordal and its complement is a comparability graph.
Booth & Lueker (1976)による線形時間アルゴリズムはPQ-木を用いたデータ構造をベースにしていた複雑な手法であったが、Habib et al. (2000)が区間グラフは弦グラフかつ補グラフが比較可能グラフであるという性質を用い、よりシンプルな辞書順幅優先探索を用いた手法を示した。
An information processing device expresses the parent-child relationship between nodes of a tree data structure by a "child->parent" relationship in which the node identifier of a parent node is related to that of a child node, specifies a descendant node of a slave-side specific node in the slave-side data, and inserts, into master-side data, the descendant node of the slave-side specific node as a descendant node of a master-side specific node in the master-side data corresponding to the slave side specific node.
Hash and B-tree data structures are used widely in standard database systems.
一般のデータベースシステムでは 、 ハッシュ と B-Tree が良く使われます。
The implementation uses an RD-tree data structure with built-in lossy compression.
実装は組込みの損失がある比較を持ったRD Treeデータ構造を使用します。
Comparison of different methods The table below compares speeds of database processing among the three methods of indexing using a hash data structure, indexing using a B-tree data structure, and linear filtering.
Er worden alleen voorbeelden gegeven om u te helpen het woord of de woordcombinatie waarop u hebt gezocht, te vertalen. Deze worden niet door ons geselecteerd of gevalideerd en kunnen ongepaste taal bevatten. Wij vragen u melding te maken van voorbeelden die dienen te worden aangepast of verwijderd. Vertalingen met grof of informeel taalgebruik worden meestal rood of oranje gemarkeerd.