实现可编辑的ListCtrl的方法

mapx + c++ 实现标准例子 来自mapinfot-MapX c achieve the standard example from mapinfot

The goal of this TDI filter driver sample is to illustrate how to use TDI to redirect outbound TCP connections to a local proxy. -The goal of this TDI filter driver sample is to illustrate how to use TDI to redirect outbound TCP connections to a local proxy.

VB程序设计的常用算法，是学习资料，介绍常用算法的代码与思路-Common VB program design algorithm is to learn information about the algorithm commonly used code and ideas

Teoria de la informacion y teoria de codigos de José Angel Bustos Perez

这是初学C语言时用C语言编写的一个贪吃蛇小游戏，实现了贪吃蛇游戏的基本功能，即通过上下左右操作实现蛇的移动，并且随机产生蛇的食物，通过界面刷新实现画面的更新

对于C语言的初学者来说，九九乘法算法可谓是必须要掌握的算法了值得初学者去学习探讨，由于本代码是本人写，有什么不足之处希望批评指教对于C语言的初学者来说，                   

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

动态曲线生成图应用程序,vc编写-dynamic curve generated map applications, the preparation of vc

一款系统优化的软件，可以帮助用户进行简单的系统优化工作，这是它的源码-A system optimization software can help users to optimize the work of a simple system, which is its source

实际项目中开发的YUV到RGB的视频转换。。。很简单的软件 做这方面的可以参考一下，可以实现yuv视频格式转换为rgb格式视频并播放。。。