Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
標(biāo)簽： available libraries Although nearly
上傳時(shí)間： 2014-01-22
上傳用戶：zhoujunzhen
with this program you can search your whole driver and list all files in a tree view box.
標(biāo)簽： program driver search files
上傳時(shí)間： 2013-12-16
上傳用戶：源弋弋
pat-tree中文抽詞,中文字詞搜尋演算法.
上傳時(shí)間： 2013-12-06
上傳用戶：hakim
此程序用到了,ADO連接ACCESS數(shù)據(jù)庫,切分窗口,以及不同視圖之間進(jìn)行通信.List Control和Tree Control,用戶UI線程等技術(shù).
標(biāo)簽： Control ACCESS List Tree
上傳時(shí)間： 2015-06-22
上傳用戶：tb_6877751
數(shù)據(jù)結(jié)構(gòu) Balance-Bi-Tree 數(shù)據(jù)結(jié)構(gòu) Balance-Bi-Tree 數(shù)據(jù)結(jié)構(gòu) Balance-Bi-Tr
標(biāo)簽： Balance-Bi-Tree Balance-Bi-Tr 數(shù)據(jù)結(jié)構(gòu)
上傳時(shí)間： 2014-01-05
上傳用戶：彭玖華
數(shù)據(jù)結(jié)構(gòu) Balance-Bi-Tree 數(shù)據(jù)結(jié)構(gòu) Balance-Bi-Tree 數(shù)據(jù)結(jié)構(gòu) Balance-Bi-Tr
標(biāo)簽： Balance-Bi-Tree Balance-Bi-Tr 數(shù)據(jù)結(jié)構(gòu)
上傳時(shí)間： 2013-12-12
上傳用戶：R50974
Included are the files wav1.m, wav2.m, wavecoef.mat and readme. wav2 function implements the tree structured wavelet transform of the input matrix, up to the given level of decomposition. Wav2 uses another function called wav1, which takes the well known wavelet transform of the given matrix. Daubechies wavelet coefficients are used for wavelet transform operation wahich is saved in wavcoeff.mat.
標(biāo)簽： implements the wav Included
上傳時(shí)間： 2015-06-23
上傳用戶：愛死愛死
MIB Browser allows you to view the hierarchy of SNMP MIB variables in the form of a tree and provides you with additional information about each node. With MIB Browser you can easily load (compile) standard and proprietary MIB files, view and manipulate data that is available in an SNMP agent.
標(biāo)簽： MIB the hierarchy variables
上傳時(shí)間： 2015-06-30
上傳用戶：eclipse
TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.
標(biāo)簽： leaves its TwoEmbranchmentTree has
上傳時(shí)間： 2013-12-11
上傳用戶：電子世界
這個(gè)是我自己寫的一個(gè)關(guān)于qpsk的mimo信道的zero forcing解碼方式.
標(biāo)簽： forcing qpsk mimo zero
上傳時(shí)間： 2014-01-08
上傳用戶：royzhangsz
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
