libpcap

信使小精灵,是一个简易的聊天工具。主要是演示了网络编程的主要步骤。本程序使用封装好的函数库，使得应用层不需要考虑网络消息是如何被接受和发送的，也不需要考虑数据粘包和丢包的刺手问题，你只要调用相应的函数就可以了。函数库为你做好了这些工作。你只需要定义自己的协议头和消息结构体，定义好网络消息的回调函数就可以了。 -messenger elf is a simple chat tools. A major demonstration is the main network programming steps. The programs use Packaging good libraries, makes application layer need not consider the network news is how it has been accepted and sent, and do not need sticky packets of data and packet loss of a thorn in hand, as long as you call the corresponding function on it. Functions well as your work. You only need to define its own agreement head and the structure of news, the definition of a good network news callback function on it.

一款简单的聊天类程序，易上手，方便大家学习-A simple chat-type procedures,易上手to facilitate U.S. study

这里是一段关于生成数据是定义数据包中内容时用到的一个byte数组的定义和合并方法-here is a generation of the data definition packet content used in a byte array to the definition and method of merger

MySQL Pocket Reference网络编程：数据库-MySQL Pocket Reference Network Programming : Database

VB windows网络编程的配套光盘，里面有大量成熟的源码可以利用-VB windows network programming matching CD-ROM, which has a large number of mature source can be used

通过arp协议来发现局域网内的所有的当前活动的主机，编译本程序需要安装winpcap驱动以及其开发包，release之后仅仅需要安装winpcap的驱动就可以了-Arp agreement through the LAN to discover all the current activities of the host, the compiler of this procedure will need to install WinPcap driver as well as its development kit, release after only need to install the WinPcap driver can be a

网络五子棋程序源码，使学习使用MFC的CAsynSocket进行网络编程好例子。-network renju procedures source, so learning to use the MFC CAsynSocket network programming good example.

一个类似于BT下载软件得源代码，现在非常流行得，值得去研究，我没有试过，大家一起研究把-similar to the one BT download software in source code, are now very popular in, it is worth studying, I have not tried to put together research

单射函数问题 设函数f将点集S = {0,1, , n -1}映射为f (S) = { f (i) | iÎ S} Í S 。单射函数问题要 从S中选取最大子集X Í S 使f (X )是单射函数。 例如，当n=7， f (S) = {1,0,0,2,2,3,6} Í S 时， X = {0,1,6} Í S 是所求的最大子集。-Injective function, the function f the problem will be the point set based S = (0,1,  , n-1) maps to f (S) = (f (i) | iÎ S) Í S. Injective function of the problem from the largest subset of S, select the X Í S so that f (X) is injective function. For example, when n = 7, f (S) = (1,0,0,2,2,3,6) Í S, when, X = (0,1,6) Í S is a subset of the desired maximum.

我自己用Visual C++6.0编写的简单的聊天程序，比较简单，特别适合初学者学习借鉴之用。-I am using Visual C++6.0, prepared by the chat program easy, relatively simple, especially suitable for use for beginners to learn from.