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
解決時(shí)鐘問題，acm競(jìng)賽題 A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
標(biāo)簽： 時(shí)鐘
上傳時(shí)間： 2015-05-21
上傳用戶：rishian
Create a time protocol over Client/Server Environment by sending request about time to server from client and the server will response to give the correct time back to the client.
標(biāo)簽： time Environment protocol sending
上傳時(shí)間： 2015-05-23
上傳用戶：guanliya
This a two node test, requires a Coordinator and an RFD. The coordinator and node simply ping-pong a packet back and forth, and print out the RSSI byte. The RFD waits before bouncing it back, while the coordinator responds immediately.
標(biāo)簽： node Coordinator coordinator and
上傳時(shí)間： 2013-12-24
上傳用戶：ardager
These files are for testing the ADC (AD9240) and DAC THS8133 (DAC1). The ADC and DAC are tested in loop back.
上傳時(shí)間： 2014-08-15
上傳用戶：lnnn30
hese files are for testing the Video ADC (TLV5734) and DAC THS8133 (DAC0). The ADC and DAC are tested in loop back.
上傳時(shí)間： 2015-09-28
上傳用戶：youlongjian0
This manual describes omniidl, the omniORB IDL compiler. It is intended for developers who wish to write their own IDL compiler back-ends, or to modify existing ones. It also documents the design of the compiler front-end for those poor souls who have to track the IDL specification.
標(biāo)簽： developers describes compiler intended
上傳時(shí)間： 2015-10-07
上傳用戶：84425894
This a simple hardware UART test program. It receives text lines over the serial port and writes back a status msg with length and contents of the buffer.
標(biāo)簽： hardware receives program simple
上傳時(shí)間： 2015-10-19
上傳用戶：xlcky
This simulation script set allows for an OFDM transmission to be simulated. Imagetx.m generates the OFDM signal, saving it as a windows WAV file. This allows the OFDM signal to be played out a sound card and recorded back. Imagerx.m decodes the WAV to extract the data. settings.m contains all the common settings to specify all the simulation parameters such as FFT size, number of carriers, input data source file, input and output WAV files, etc.
標(biāo)簽： transmission simulation generates simulated
上傳時(shí)間： 2013-12-15
上傳用戶：dyctj
屏幕上方的字母隨機(jī)出現(xiàn) 第一個(gè)方框內(nèi)的數(shù)字表示操作者打字正確的個(gè)數(shù)(可表示0-999) 第二個(gè)方框內(nèi)的數(shù)字表示在某個(gè)等級(jí)里所出現(xiàn)字母的個(gè)數(shù)(可表示0-999) 第三個(gè)方框內(nèi)的數(shù)字表示在所有等級(jí)里所出現(xiàn)字母的總個(gè)數(shù)(可表示0-999) 按空格鍵選擇打字等級(jí), 即字母下落的速度快慢,分六個(gè)等級(jí),其中第一級(jí)最快,第六級(jí)最慢 按回車鍵確定進(jìn)入游戲 按ESC鍵可隨時(shí)退出,否則,將繼續(xù)進(jìn)行 按BACK鍵后退一格重新選擇等級(jí)
上傳時(shí)間： 2015-10-27
上傳用戶：xuanchangri
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
