P2P网络电视

1、异步操作方式。设备连接和短信发送均采用异步方式，即容器程序调用连接函数或发送函数后立即返回。由控件自行完成连接或发送过程，当操作完成后，将执行结果以事件的形式通知容器程序。 2、内部包含收发缓冲队列。控件可以同时接受容器程序较多的发送请求，控件将这些发送请求放到一个发送队列中，控件依次逐个执行该发送队列，并将执行结果以事件的形式通知容器程序。控件包括了内部发送队列和内部接收队列，并且提供了队列的处理情况的访问方法，根据这个特性，容器程序可以连续提交多个短信发送请求； 3、支持多个控件并行工作。在一个程序中使用可以使用多个短信控件（即同时连接多个GSM Modem设备）时，如果要发送一条短信，容器程序可优先选择发送队列为空的短信控件发送，或者选择发送队列中剩余发送条数最少的短信控件发送。 -1, asynchronous mode of operation. Connectivity and equipment were used to send messages asynchronous modes, namely containers Invoking connecting function or sent immediately after the function returns. By linking its own control or sent to the process, when the operation is completed, the results will be implemented in the form of Vessel notification procedures. 2, the internal transceiver contains a buffer queue. Controls can also accept containers of this process more requests, these controls will be placed in a request sent this cohort, the controls were sent individually to implement the queue, and will result in the implementati

用ListView仿资源管理器 自己看看 怎么这么麻烦-ListView used fake Resource Manager to see for yourself how such trouble

一个可以多选的树控件，扩展MFC标准的CTreeCtrl。(One can choose the tree control, expand the MFC standard CTreeCtrl.)

结合SQL SERVER数据库，查询所有数据库记录-with SQL Server database, query the database for all records

实现了树形控件，并能在控件上右击，弹出菜单，进而实现树形控件的增加、删除。适合队树形控件的初学者-Realized the tree control, and can control on the right-click, pop-up menu, and proceed to realize the tree controls to add, delete. Suitable for beginners team tree control

The CPropTree class implements a tree control that is similar to the property view seen in Visual Studio .Net. The source project compiles to a DLL so you can easily incorporate it into your project. You can check my web page for more information on the control.-The CPropTree class implements a tree cont rol that is similar to the view seen in property V isual Studio. Net. The source project compiles to a DLL so you can easily incorporate it into you r project. You can check my web page for more info rmation on the control.

给定树节点数据查树深度. 对树算法进行简单的剖析-A given tree node data on the depth of search tree. For a simple tree algorithm analysis

通过删除节点，可以删除相映的记录，包含带子节点的节点-by removing nodes can be removed form a contrast to the record, including scallops of nodes

This project is to show the tree I dreamed when I first met the ternary tree concept. When I came upon the ternary tree, I get awed! It s amazing that an idea so simplistic could be so strong and fast. But it had flaws... the first one is the memory consumption. The hash table implementation consumes far less memory than the ternary tree! The second flaw is the ternary tree can be fragmented and be extremely unbalanced (as the algorithm doesn t do any balancing step) so the tree also needs a way for balancing the nodes. I tried to reduce the memory consumption by grouping three nodes into one new "int" node. -This project is to show the tree I dreamed wh en I first met the ternary tree concept. When I ca me upon the ternary tree, I get awed! It"s amazing that an idea so simplisti c could be so strong and fast. But it had flaws ... the first one is the memory consumption. The has h table implementation consumes far less memor y than the ternary tree! The second flaw is the te rnary

rxlibford7.rarr xlibford7.rar