指纹识别

Customizable Tool Bar for VC

用 VB 做的 GPS 通讯程序，显示当前时钟。-do with VB GPS communication process, showing current clock.

一个使用Delphi控制浏览器的例子-use a browser control Delphi examples

手机上的拳击游戏，完全可以和PC机上的拳击游戏相当-phone boxing game, it is entirely possible and PC games on the considerable boxing

已知一颗有根树是 2-tree（只有度为2和度为0的结点），并且有n个叶子节点，从左到右编号为1,2,…, n，还知道两个相邻编号节点之间的 ChonSu（这棵树中这链接这两个节点的路径的边数）。求任意两个叶子节点x, y （1≤x≤n）之间的 ChonSu-Rooted tree is known to a 2-tree (only the degree 2 and degree 0 nodes), and there are n-leaf nodes from left to right numbered 1,2, ..., n, also know that two adjacent numbers between nodes ChonSu (this tree that links these two nodes in the path of the number of edges). Seeking any two leaf nodes x, y (1 ≤ x ≤ n) between the ChonSu

本程序是经典游戏坦克大战的源码，对于喜欢游戏制作的同学来说是一个很好的借鉴作品。-This procedure is a classic game Tankedaizhan the source, for students like the game is a good reference works.

HEX-VIEW是一个十六进制察看/编辑程序，虽然还不完善，但毕竟是一个可以运行的版本了，编写这个程序的目的是想深度探索处理过程。程序界面显示文件的每一个十六进制，ascii码，二进制和十进制字节。十六进制地显示在左侧，分十八列，对应的ascii码值显示在右侧。二进制和十进制值地显示可选。本程序用turbo c++3.1开发。用其它与dos兼容的编译器应该可以编译，但没有测试过。-HEX-VIEW is a hexadecimal probation/editor, while not perfect, but that is a running version, the preparation of this procedure is designed to explore the depth process. Program Interface documents show a 16 per band, ascii code, binary and decimal bytes. Hexadecimal displayed on the left side, 18 minutes, the corresponding code ascii value shown on the right. The binary and decimal value shows optional. The procedures used turbo c 3.1 development. In other dos compatible with the compiler can be compiled, but not tested.

这是一个用c#的水晶报表视频教程 一，可以看看的-Crystal report control technical guide video, using C# language

一个很好的类，左边一个列表框，中间四个按钮，右边一个列表框。中间的四个按钮可以实现两个列表框内容的移动。 使用方法：只要将两个列表框以及四个按钮的ID传给类即可-a good class, left a list box, the middle four buttons, the right side of a box. Among the four buttons can be achieved List Box 2 mobile content. Use : As long as two to the list box and four button ID can pass category

array.h： 安全数组 linkedlist.h： 普通表 dclinkedlist： 双向循环链表 hashtable.h： 哈希表 binstree.h： 二叉搜索树 avltree.h： AVL 树 如果要存储集合（元素不可重复）并快速查找，最佳的是 binstree.h（二叉搜索树）。 如果要存储二维或更高维的表格，最佳的是 hashtable.h（哈系表）。AVL 树的插入成本非常高（删除函数也没有实现），但 AVL 的搜索效率极高，所以适用于在程序开始前初始化程-NOTE: array.h :secure array,linkedlist.h:common table, dclinkedlist:dual cycle linkedlist, hashtable.h:hash table binstree.h:binary search tree, avltree.h: AVL tree, if you want to store set(elements no repeating) and to lookup it swiftly,best is binstree.h(binary search tree).if you want to store two dimensions s or more dimensions s table,best hashtable.h(hash table).the cost of AVL tree s insertion is very high(delete function is not completed),but effiency of AVL tree s search is very high,so it is the same with initialize programme before beginning programme.