This is a serial mouse driver, which is compliant with Plug and Play, supports dynamic detection (via serenum) and removal (either hotplug or via the device manager). The code serves as a sample for any serial-enumerable device. The behavior of the various routines is documented in the source code files.
A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is.
簡單混合衰落信道
This mfile inputs an unmodulated sinewave through a simple Rayleigh two path fading channel and shows the output with phase, gain, and attenuation characteristics via animation.
Unzip this file into a writeable directory.
You should end up with a "Geocode" project, as well as Bitmaps and TestData directories.
This sample geocodes single-match zip codes, entered by the user, or a batch-match of a table of zips (and other info) against a point shapefile.
The point data shapefile consists of 41859 point features from 1996 GDT data, in decimal degrees. The table of zips that can be used in the batch match consists of 38 records, entitled "few_zips.dbf".
More specifcs are found at the top of each form and are provided throughout the code.
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.