MFC prepared smart scroll

详细讲解进程间通讯的四种方式：剪贴板、匿名管道、命名管道和邮槽。并比较分析这几种进程间通信的优点和缺点。-explain in detail the communication process in four ways : the clipboard, anonymous pipes, named pipes and mail chutes. And a comparative analysis of these types of inter-process communication advantages and disadvantages.

应用背景这是原始winsparkle增强，它不支持多本地化的发行说明。& nbsp；这是原文链接： ；http://winsparkle.org/你可以从codeforge下载稳定版，或查看我的 ；增强版： ；https://github.com/huangkbaaron/winsparkle/关键技术这是原文链接： ；http://winsparkle.org/我的提升将是一个小样本的C++ lambda表达式。

从文件中读去,反向打印文本,针对英文文章,按行反向-Reverse print for English articles, in accordance with the reverse line

定时关机程序，设定好时间就行-Mytob.BSNotes procedures and set a good time on the line

图像的连续读取采集（从摄像头）、显示和存储，利用opencv平台提供的函数，存储时只保存最近的100张采集图片（避免图片填满硬盘）

打开真彩色位图，很有用，可以方便编程空间-this is bit picture .it make program easy

用基于变治法的堆排序算法对任意一组给定的数据进行排序 设计与实现堆排序算法； 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.

学习WPF时写的DOME，很多很花的功能还不会做，这是最最最最最简单的-When learning WPF written DOME, spent a lot of features will not do, this is the most most most simple

全排列算法，递归实现全排列，可以对任意字符实现全排列，但长度有限制-Full-order algorithm, recursive realization of the entire array can be arbitrarily wide array of characters, but there are restrictions on the length of

USB 识别盘符 代码高效，运行稳定-USB drive letter code to identify efficient and stable operation