方便的数据库连接调试程序

Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plemen

C++面试试题，值得一看-C interview questions, the eye-catcher

java 数据结构与算法译作者： [美]Clifford A.Shaffer著 张铭 刘晓丹译 　　包含范围：Java算法 　　尽管基本上Java图书都是讲Java本身的特性。因为Java的体系太庞大了，而用Java来实现的数据结构与算法，这本书也是唯一一本，所以尽管这本不是那么的好但还是做以推荐 -java construction of data and algorithm translated work: [ Is beautiful ] Clifford A.Shaffer inscription Liu Xiao Dan to translate Contains the scope: Java algorithm Although the basically Java books all speak the Java itself characteristic. Because of Java system too huge, but construction of data and algorithm which realizes with Java, this book also is only 11, therefore although this originally is not such is good but or does recommends

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

数据结构的教程-data structure Guide

最短路径方法The shortest path method-The shortest path method

应用背景关键技术

气泡排序，一个简单的排序10个数字，按从大到小排列-Bubble sort to sort a simple 10 figures, according to smallest order

实现了二叉排序树的所有功能 建立，增，删，改，查 -Achieved a binary sort tree all the features of the establishment, increase, delete, change, check

Large sclae prepocess data for data mining and code