-
BloomFilter.java
实现基于redis的bloomFilter(the implements of bloomfilter based on redis)
- 2020-06-18 00:40:02下载
- 积分:1
-
一个网络侦听器源码,基于Winpcap开发(运行时需安装Winpcap),能够监听所有以太网帧,并具有简单的协议分析功能。代码比较清晰,能够给有志于开发抓包软件
一个网络侦听器源码,基于Winpcap开发(运行时需安装Winpcap),能够监听所有以太网帧,并具有简单的协议分析功能。代码比较清晰,能够给有志于开发抓包软件的读者提供参考。-A network of listener-source, based on Winpcap development (run-time to install Winpcap), able to monitor all the Ethernet frames, and has a simple function of protocol analysis. Clearer code, able to capture those who want to develop software to provide reference readers.
- 2022-01-25 20:32:14下载
- 积分:1
-
Accelerator
快速定位或查找文件,是在vc6.0环境下开发的,由于本人是菜鸟,功能不太好用(Quickly locate or find the file that is under development in vc6.0, because I am a rookie, function not easy to use)
- 2011-06-06 12:00:21下载
- 积分:1
-
shujucaiji
数据采集应用与编程(打开文档密码为8008100345).pdf
研华的采集卡的相关的的编程指南(Data Acquisition Application and Programming (open document password is 8008100345). Pdf Advantech card collection related to the Programming Guide)
- 2008-01-20 19:31:33下载
- 积分:1
-
EmptyImmutableListMultimap
Implementation of with no entries.
- 2014-01-22 14:17:28下载
- 积分:1
-
Matrix-Operations(Complete)
一次数据结构课小组形式的大作业,实现矩阵的全套运算。包里有两个压缩文件,一个是生成dll的VS工程,另一个是加载dll的exe界面(The form of a data structure class group of large operations, to achieve a full set of matrix operations. Bag has two compressed files, one is to generate dll in VS project, and the other is to load the dll, exe interface)
- 2011-05-03 10:36:05下载
- 积分:1
-
745454
网络服务,精选C#编程学习源码,很好的参考资料。(Network service, select learning C# programming source code, a good reference.)
- 2013-12-15 10:53:33下载
- 积分:1
-
ClassHierarchyTraveler
Class Hierarchy Traveler Source Code for Andriod.
- 2013-12-04 10:20:18下载
- 积分:1
-
P2P applications: BitTorrent source code
P2P应用:BitTorrent的源代码-P2P applications: BitTorrent source code
- 2023-09-02 03:40:02下载
- 积分:1
-
knapsackproblem
有不同重量的物品n件,求从这n件物品中任取一部分物品放入背包,使选中的物品的总重量不超过指定的限制重量,但选中物品的价值之合为最大。即任意给定物品个数及它们的重量和价值,在最大的限制重量一定的情况下,为了使价值最大,选出最优解。(There are different weights of items n pieces from n items in order to obtain any portion of the goods into the backpack, so that the total weight of the selected items does not exceed the specified weight limit, but the combined value of selected items as the greatest. That any given number of items and their weight and value limits the maximum weight of certain circumstances, in order to value the most, select the optimal solution.)
- 2010-03-09 08:21:56下载
- 积分:1