-
自己写的一个进程间通讯库,使用很方便。
带有例子程序。...
自己写的一个进程间通讯库,使用很方便。
带有例子程序。-Wrote it myself a process of communication among libraries, use very convenient. With examples of procedures.
- 2022-07-07 15:47:26下载
- 积分:1
-
使用OPNET仿真网络入侵
Network Intrusion Simulation Using OPNET
- 2022-01-25 15:29:58下载
- 积分:1
-
串口检测程序
串口检测程序 -Detecting serial
- 2022-07-15 10:51:06下载
- 积分:1
-
中文RFC文档,不用翻译,对学习很有帮助!
中文RFC文件,无需翻译,对学习很有帮助!
- 2022-01-21 02:36:20下载
- 积分:1
-
the purpose is to make the data 0123H, 0456H, 0789H, 0abcH. 0defh, 0fedh, 0cbah,...
程序的目的是想让数据0123H,0456H,0789H,0abcH,0defh,0fedh,0cbah,0987H逆序存放
我的运行环境:wxp sp2+masm611,
-the purpose is to make the data 0123H, 0456H, 0789H, 0abcH. 0defh, 0fedh, 0cbah, 0987H Roget I kept the environment : wxp sp2 masm611.
- 2022-07-02 07:23:17下载
- 积分:1
-
使用nntp协议实现文件断点续传的程序
使用nntp协议实现文件断点续传的程序- Uses procedure which the nntp agreement realization document
break point continues passes on
- 2022-09-06 20:35:02下载
- 积分:1
-
堆积(heap)是树结构的第三种型态。堆积是一棵二元树,其左右子树节点的值均较其父母节点的值小。堆积的根节点值保证是该树最大值。这中堆绩称为最大堆绩。堆积的子树...
堆积(heap)是树结构的第三种型态。堆积是一棵二元树,其左右子树节点的值均较其父母节点的值小。堆积的根节点值保证是该树最大值。这中堆绩称为最大堆绩。堆积的子树可摆在左边当左子树,也可摆在右边当右子树,因此左右子树俱有相同的性质。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of their parents the value of small nodes. Accumulation are the root of the tree to ensure that the value of Maximum. This is known as the greatest performance in the reactor performance heap. Accumulation of sub-tree can be placed at the left when the left subtree can also be placed on the right when the right subtree, so there is about the same subtree of the nature of both.
- 2023-07-10 01:50:03下载
- 积分:1
-
有关开发zigbee的产品测试说明,比较有价值啊
有关开发zigbee的产品测试说明,比较有价值啊-zigbee the development of the product testing shows that valuable ah
- 2022-06-16 02:11:09下载
- 积分:1
-
Chinese RFC documents, without translation, the right to study very helpful!
中文RFC文件,无需翻译,对学习很有帮助!
- 2022-01-31 18:26:53下载
- 积分:1
-
OpenH323 DLL libraries
OpenH323 DLL libraries
- 2022-02-07 05:35:56下载
- 积分:1