how to get host logical drivers ,use function:GetLogicalDrives()

这是一个自己编写的基于C#的Winform的一个音乐播放器小软件，可以实现基本的播放功能，添加歌曲，循环播放，单曲循环，列表播放等等。简单实用，方便快捷。

二进制浏览器,一个功能很强大的对二进制进行处理-binary browser, a very strong function of the binary address

系统会自动删除目录，所以请不要将文件放在这两个目录下请认真阅读您的文件包然后写出其具体功能-The system will automatically delete the directory, so please do not file on this directory both Please read them carefully package your specific function and then write

C++核心思想的全书源代码，包括代码和头文件-core thinking of the C source code for the book, including code and header files

在LabWindows中要求对测量时间的控制精确度很高，为此我们常用Timer控件并不能精确控制。在此例程中列举了同步定时器与异步定时器，希望对大家有帮助。-In the LabWindows called for measuring time in the control of high precision, for which we often can not be precise control Timer control. Listed in this routine of synchronous and asynchronous timer timer, want to help everyone.

派生 CAsyncSocket 实现文件传输 只用几句代码实现-public CAsyncSocket for file server

ntpclient的源代码压缩包，主要用来同步NTP服务器时间。

Power PC 55xx flexray 通信-Power PC 55xx flexray communication

第一次来，临时载点儿源码。没有什么说明，就为自己能下一点儿源码而来。 如果真有所收获，我以后就常来这儿，就我自己的源码整理后在上传。-The first time, the Provisional contains some source code. There is nothing that they can for the next bit from the source. If the gain, I ll come here often on my own after finishing uploading source.

Description: 对整型有序关键码序列进行折半查找，待排序序列以数组存储。如果找到待查记录，返回找到的位置下标，并删除该关键码记录；如果没找到待查记录，返回0，并将待查记录插入到适当位置，即该查找属于动态查找。输出查找过程中每一轮的low，mid，high 值，以及与给定值相比较的关键码值，并输出最后找到的位置，及变化后的数组。 注意：该数组为整型，数组中关键码存储位置为r[1]~r[n]，r[0]留作它用，且关键码个数大于4. Input Format: 第一行输入数组中记录个数n 第二行输入n个有序的整型关键码，以空格隔开 接下来输入三个待查关键码，每个关键码占一行 Output format: 对于每个关键码，分别输出： 找到给定值之前的每一轮的low，mid，high及相比较的待查找序列中的关键码，以空格隔开 接下来一行输出查找到的位置 接下来一行输出变化后的待查找序列 -Description: The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the locat