MFC matching easy source. Oh well. Classic. Very helpful Oh

这个项目主要功能是评论点赞无刷新 还有增删改查

本程序模拟windows任务管理器的内存管理，界面可能丑陋点，但是还可以用-the simulation windows task management device memory management, interface may be ugly, but can also use

国外结构计算程序，FORTRAN高级语言编写，主要用于结构分析。-abroad structure calculation procedures, the High FORTRAN language, mainly for structural analysis.

vc++6.0 下的DLL开发技术原型，实现了遍历文件夹下的所有dll文件，并加载，创建自定义菜单，和调用示例。-DLL under vc++6.0 development technology prototypes, realized the folder traversal of all dll files and loaded, create custom menus, and call the sample.

Frameworks Transactor Client DLL. It converts to API all XML messages required by Transactor 2.1

这是一个关于tree kernel 的文章，很有帮助。比较新的文章-This is an article on the tree kernel to deal with it. Relatively new article

AspcnUP 上传组件-AspcnUP

实现定时器算法逻辑，本身不带定时驱动器 TimerLogic实现了一个模拟的时钟，这个时钟的最上一层（类似秒针）是一个256个刻度的盘子，下面四层（类似分钟，时针）有刻度是64的小盘子，上层转一圈之后下一层的刻度就走一个刻度。指示当前盘子走到那个刻度是TimerVec（或TimerVecRoot）的index。-achieve timer algorithm logic, it should not take regular drives TimerLogic achieved a simulated clock, the clock on the floor (similar hands of) 256 is a calibration of the dishes, the following four (similar minute hand of a clock) is a scale of 64 small plates, the upper circle turn Zhi after the next level of calibration leave a mark. The current instructions that come calibration plate is TimerVec (or TimerVecRoot) index.

以深度为k的满二叉树(n=2k-1)为例，假设表中每个记录的查找概率相等，即 pi=1/n（1≤i≤n），而树的第i层上有2i-1个结点，因此，折半查找的平均查找长度为： 所以，折半查找的平均时间复杂度为O(log2n)。 -To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).

很不错的数据同步软件，很小但是功能很强大，值得学习-Very good data synchronization software, a small but very powerful features, it is worth learning