just learning programming, exhibitions

自己写的一个日志类,使用非常简单. 用了很长时间,这里推荐给大家,大家可以自由修改.-To write a log type, the use of very simple. Spent a long time, recommend to everyone here, we can freely modify.

GDI+阴影与光辉效果,转自CODEPROJECT。NET-GDI+ Shadow and brilliant effect, carried CODEPROJECT. NET

数据结构中图的邻接表实现 c++ 实现大部分功能 学习的好参考-c++ MAP

本程序主要用于模拟某银行一天的营业状况，可用文本配置窗口、 座位数和测试分钟数-This procedure used to simulate a situation in the banking business day

不使用控件实现文件的打开、浏览、保存功能-not to use controls to open the files, browsing, retention

通过OpenProcessToken来获取进程令牌，并进一步调整令牌权限，最后通过ExitWindowsEx来实现 注销 关闭 重启操作

计算机windows 并口编程 可以看看，不错的-Computer parallel port programming windows can see that good

我平时积累的一些小程序,对于参加计算机等级考试的人很有帮助哦-I usually have accumulated a number of small procedures, the take part in a person NCRE helpful Oh

服务端为win32服务程序， 用cmd命令安装 jrserver -i 或 jrserver -u删除，客户端与服务端采用socket连接， 客户端用配置文件保存服务器端口和地址和登录账号，服务装在其他电脑上需配置IP,服务端可以连接sql数据库，需要修改连接字符

Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割―归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割―归并法相当，较好的情况下快于分割―归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it"s computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.