weeks quick calculation speed counting weeks

WinCE下有名Event事件编程源码 WinCE named event 在进程之间信息传递方法代码 CreateEvent 工程代码 OpenEvent工程代码-WinCE programming under well-known events Event Source WinCE named event in the process of information transmission method between the CreateEvent engineering code code code OpenEvent works

"一笔画回路问题"刚刚学习C++,学习怎么样用友元的基本用法！！1-err

本企业库存管理系统具有如下功能：库存基本信息的录入、修改、查询、删除模块，商品调动信息的录入、修改、查询、删除模块，以及系统维护功能。为企业库存管理提供信息咨询，信息检索，信息存取等服务，基本上能够满足现代企业对库存管理的需要-Inventory management system of the enterprises have the following functions: inventory of the entry of basic information, modify, query, delete the module, the entry of goods to mobilize information, modify, query, delete the module, and system maintenance functions. Inventory management for the enterprise to provide information consultation, information retrieval, information access services, primarily to meet modern business needs of the inventory management

图书搜索名单最近5个等级的产品总额评级产品顶级厂商的产品供应商的搜索最近5个等级的供应商总额等级的供应商产品列表和每个产品的供应商销售总额评级

基于颜色特征的图像检索系统，项目全部打包的，里面的exe文件是可以执行的文件，opencv的c++图像检索系统。环境配置成功就可以使用，基于颜色特征的图像检索系统

copy命令C源程序,VC6.0与GCC上调试通过!-copy command C source, VC6.0 with GCC debug through!

WndTabs_src

实现系统多进程管理的银行家算法，合理的避免了进程因为竞争同一资源而出现的死锁问题-achieve multi-process management system bankers algorithm, reasonable process to avoid the same resources as a result of competition arising from the issue Deadlock

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.

Example for multithread programing