智能电饭煲系统proteus仿真

java下的小游戏程序-the small Games

这一小段程序是用来检查当前所用的计算机是否满足所设精度的要求。-This is a short procedure is used to check whether the computer is currently using to meet the established accuracy requirements.

my little small funny TicTacToe game -my little small funny TicTacToe game

多元多峰函数的优化实例 第10行各变量的上下限改为[-10 10]，原来为[-3 3]； 第25行改为：[Y, I]=min(ObjV) 原来为[Y, I]=min(ObjVSel) 以此将染色体的个体值与shubert()函数值对应起来，原表达式不具有shubert()函数自变量和应变量的对应关系 -Multi-multi-peak function optimization examples of the first 10 lines the upper and lower limits of each variable changed to [-10 10], originally for the [-3 3] No. 25 line changed to: [Y, I] = min (ObjV) the original of [ Y, I] = min (ObjVSel) this will be the individual value of chromosome shubert () function values corresponding to the original expression does not have shubert () function from the variables and should correspond to the relationship between variables

一个简单的仿T9输入法-a simple imitation of T9 input method

Templates are among the most powerful features of C++, but they are too often neglected, misunderstood, and misused. C++ Templates: The Complete Guide provides software architects and engineers with a clear understanding of why, when, and how to use templates to build and maintain cleaner, faster, and smarter software more efficiently.

这是几个例子说 c# 什么。我不擅长英语。我只是想要一些点，从此页下载源。但我的消息来源也是在 c# 中为初学者很有帮助。希望能帮助 ！

一些实用的第三方类,实现功能非常方便,贴图, 状态栏进度条, 普通进度条,ADO操作,EXECLE操作, 菜单图表, -practical third category, which is very easy to achieve, mapping, status bar progress of the general progress of the operation ADO, EXECLE operation, and the menu chart

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.

OPCClient端和Server端的演示代码-OPCClient-side and Server-side presentation code