Example for multithread programing

按我理解，这就是所说的三层架构了。 File工程负责最底层的文件操作 FileProtocol工程负责具体的流程及协议，将相关数据返回给界面层 UI工程就是具体的界面层了，他只负责显示具体的数据，不负责软件的工作流程。 File, FileProtocol这两个工程都是DLL，注意看一下FileProtocol的工程依赖及附加包含目录。还要再看一下UI工程的工程依赖及附加包含目录。在这里，三个工程，项目解决方案是在同级目录下，通过一个解决方案去包含三个工程。这样做的好处在于，工程可以重用。比如说File工程，他负责最底层的文件操作，以后我们的其它软件项目还会用到它的，因此，以后的项目，在解决方案里直接添加File工程便可以用了。 -According to my understanding, this is referred to a three-tier architecture. File project is responsible for the bottom of the file operations FileProtocol charge of the project specific processes and agreement to the relevant data back to the interface layer UI project is a specific interface layer, and he is only responsible for display of specific data, is not responsible for the software workflow. File, FileProtocol these two projects are DLL, note that the works look FileProtocol dependence and additional include directories. Would also like to look at what the engineering rely on UI and additional include directories. Here, the three projects, t

著名的通信编程开放源码ACE中文档，华为等很多高级程序员使用-famous communication open source programming ACE archives, Huawei and many other senior programmers

一个使用delphi做的winsock 的别人的东西我转发一下-a use of the protocols of doing things others forward what I

一款军舰释放炸弹炸潜艇，潜艇可释放鱼雷炸军舰的游戏。用MFC实现框架编写的程序。用链表实例化各个对象，方便删除和添加对象-The release of a bomb submarine warships, submarines, warships may be the release of the game torpedo bombing. MFC framework used to achieve the preparation procedures. List examples of use of various objects, delete and add the object to facilitate

这程序实现pascal词法分析，把源程序逐行读入一个字符串缓冲区中，然后逐行分析。适合手一看。-this program pascal lexical analysis, source progressive read into a string buffer, and then progressive analysis. For a look at hand.

12 bit da转换器dac7611驱动程序(C源程序)-da 12 bit converters dac7611 Driver (C source)

This function calculates the Kullback Leibler divergence distance for Gaussians.

开发此项目，是为了快速解决用户的救援请求， 使后台工作人员分工更加明确，很好的为用户服务

用基于变治法的堆排序算法对任意一组给定的数据进行排序 设计与实现堆排序算法； 2）待排序的数据可以手工输入(通常规模比较小，10个数据左右），用以检测程序的正确性；也可以计算机随机生成（通常规模比较大，1500－3000个数据左右），用以检验(用计数法)堆排序算法的时间效率。-Variable-based treatment of the heap sorting algorithm to a set of arbitrary data set to sort the design and implementation of heap sort algorithm 2) to be sort of data can be entered manually (usually relatively small size of about 10 Data), to detect the correctness of the procedure also can be randomly generated computer (usually relatively large-scale data ,1500-3000 or so), to test (with counting) time sorting algorithm reactor efficiency.

该软件使用方便,适用于各种人群 开发简单,功能强大 谢谢各位的支持使用-the software easy to use and apply to all groups to develop simple, powerful Thank you support the use of