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.
标签： bit collection including addition
上传时间： 2015-05-17
上传用户：cursor
ADUC812单片机源代码,I2C源代码,AD源代码,DA源代码,EEPROM源代码.
上传时间： 2013-12-23
上传用户：aig85
简单混合衰落信道 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.
标签： unmodulated Rayleigh sinewave through
上传时间： 2015-05-17
上传用户：CSUSheep
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.
标签： directory writeable Geocode project
上传时间： 2013-12-19
上传用户：wangchong
学生信息查询系统C语言实现 包含的功能有: 1、 系统功能选择菜单：提供了5个功能 A、 按“班级＋平均成绩”显示原始数据 B、 输入学号，显示学生档案，并可选择用顺序查找或者折半查找去实现 C、 输入不完全的学生姓名即可模糊查找学生档案。 D、 输入班级及课程即可统计平均分，优秀率及及格率。 2、 数据显示函数 3、 学号查找函数 4、 模糊查找函数 5、 成绩统计函数
上传时间： 2014-08-20
上传用户：fanboynet
hao a hao a hao a hao a hao a hao a
标签： hao
上传时间： 2015-05-18
上传用户：firstbyte
一个投影聚类算法及其数据集生成源码。 参考文献： Eric K.K. Ng, A. Fu : Efficient algorithm for Projected Clustering,
标签： A. K.K. Clustering Efficient
上传时间： 2013-12-11
上传用户：亚亚娟娟123
这是一个关于A*算法的实现8数码的程序源代码，所有的算法核心全部使用STL标准模板库编程，对想熟悉STL编程和A*算法的朋友有很好的借鉴意义。
上传时间： 2015-05-18
上传用户：zhuoying119
at91rm9200 AD/DA转换驱动 很好的驱动开发范例
上传时间： 2013-12-17
上传用户：www240697738
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.
标签： available libraries Although nearly
上传时间： 2014-01-22
上传用户：zhoujunzhen
