-
演示程序演示了保存在桌面上图标的位置
Demo program illustrates saving position of icons on windows desktop
- 2022-04-19 17:14:31下载
- 积分:1
-
图形处理用一个简单的直线,圆,矩形等图形处理…
图形显示与处理
简单的对直线,圆,矩形进行平移,缩放,旋转,反转等变换-graphics processing with a simple pair of straight lines, circles, rectangles for translation, scaling, rotation, etc. transform inversion
- 2022-06-18 13:04:13下载
- 积分:1
-
多产的PL
Prolific PL-2303 USB to Serial适配器WinCE 5.0驱动源代码-Prolific PL-2303 USB to Serial adapter WinCE 5.0 driver source code
- 2022-05-30 17:34:31下载
- 积分:1
-
a submerged platform equipment under the usb driver with embdedc 4. 0 developmen...
一个基于wince潜入式平台的设备下的usb的驱动程序,用embdedc++4。0开发的,对于初学wince的人来说有参考利用的价值,类似于windows编程的代码风格-a submerged platform equipment under the usb driver with embdedc 4. 0 development, the weights for beginners who are using the reference value, similar to windows programming code style.
- 2022-08-18 10:17:09下载
- 积分:1
-
用于控制多个线程的问题
用于控制多个线程的问题-used to control the number of threads
- 2023-05-08 05:15:02下载
- 积分:1
-
图像处理类可以很容易的处理bmp等数字图形和图像。如果你使用的话有什么bug 请通知我...
图像处理类可以很容易的处理bmp等数字图形和图像。如果你使用的话有什么bug 请通知我-This image processing class can easily process digital graphs and images, such as bmjp etc.If you find any bug during your use, please notify me.
- 2022-08-14 06:06:13下载
- 积分:1
-
这是一个用MFC编写的指针式时钟,虽然不是很难,但是对学习MFC很有好处。...
这是一个用MFC编写的指针式时钟,虽然不是很难,但是对学习MFC很有好处。-This is a prepared using MFC Pointer clock, although not difficult, but very good for learning MFC.
- 2022-05-12 11:25:58下载
- 积分:1
-
连接四个游戏
这是连接四个游戏,包含 1 7 列和 1-6 行,2 名玩家
- 2023-01-10 09:10:03下载
- 积分:1
-
该小程序是封装,实现一个图片浏览类的实例。
该小程序是封装,实现一个图片浏览类的实例。-procedure is the small package, enabling an image viewer category examples.
- 2023-08-24 04:10:03下载
- 积分:1
-
array.h: 安全数组 linkedlist.h: 普通表 dclinkedlist: 双向循环链表 hashtable.h: 哈希表 binstree.h...
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.
- 2022-08-16 05:08:19下载
- 积分:1