基于OpenDWG开发AutoCAD Proxy对象图元分解程序

输入星期几的第一个字母来判断一下是星期几，如果第一个字母一样，则继续判断第二个字母。 - enter the first few weeks to determine what are the letters a few weeks, if the first letter of the same, then continue to determine the second letter.

一个源码统计程序，统计源代码行数-a source statistical procedures, statistical source code line number

一个比较好的C程序，这是我们的课程设计得了优的程序！-a better C, this is the course we had a better design procedures!

使用CFile类实现对文件的操作-use CFile class to achieve the operation of the document

windows下，可创建多层目录的小函数，十分方便。-windows, the directory will help to create a small multi-function, it is very convenient.

该程序实现了对读取多个文件的文件路径的处理，将选中的多个文件路径显示在列表中，还实现了对某个文件夹的选择，并可将选中文件夹的路径显示在列表中-the program achieved a number of documents to read in the paper path, it will select a number of file path displayed in lists, but also to achieve a certain folder options could be selected folder path displayed in lists

Minidx字典整理程序源代码发布 几千条数据排序并去除重复纪录可以有很多排序算法直接内存中操作，但是假如说有几百万条记录需要处理，那就不一定适用了。这个程序最初的目的为了解决Minidx字典中重复数据的问题，但是发现写文件时I/O限制比较明显，虽然可以解决问题，但是效果却不怎么样。 工程基于VS2005，MFC的Unicode模式下编译的，利用了Sqlite3.5.0，作了C++封装处理。写处理中开启了事务. 相关链接 http://cn.minidx.com/index.php?option=com_content&task=view&id=88&Itemid=9 -Finishing Minidx dictionary source code release of thousands of data to sort and remove duplicate records can have a lot of sorting algorithm to operate directly in memory, but if that has millions of records that need to be addressed, it does not necessarily apply. The original objective of this procedure in order to resolve the duplication of data dictionary Minidx, but found time to write a document I/O limitations more obvious, although the problem can be solved, but not how to effect. Works based on the VS2005, MFC compile the Unicode mode, the use of Sqlite3.5.0, made C++ Package deal. Write a deal to open the Services. Http://cn.minidx.com/index.php?option=com_content

这个C程序逐字读取文件的全部内容，最后在终端上打印出来。

一个用MFC编制的BMP格式读取程序-MFC prepared to use a BMP format to read the procedures

incsrch.m root finding by incremental search requires func1.m bisect.m bisection root finding code uses function file: fcn.m falspos.m root finding by false position newtraph.m -incsrch.m root finding by incremental search requires func1.m bisect.m bisection root finding code uses function file: fcn.m falspos.m root finding by false position newtraph.m