拖动开发代码，关于pb 的

一个可以应用的案例，但是数据库操作不复杂。其中全面地涵盖了所有常用数据库操作。-1 can be applied to the case, but the database operations are not complicated. Which comprehensively covers all common database operations.

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

二叉排序树，实现简单的排序，删除，插入，保存，恢复等功能-Binary sort tree, the realization of a simple sort, delete, insert, save and restore functions

栈的基本操作，有初始化，清空，添加，删除，判空等!-stack the basic operation, initialization, emptied, add, delete, subcontracting air!

清华大学数据结构c++版的代码，很稀罕，很稀有，相当的珍贵-Tsinghua University, the data structure c++ version of the code, very rare, very rare, very valuable

TRegExpr is easy to use and powerfull tool for sophisticated search and substitutioning and for template-based text checking (especially usefull for user input validation in DBMS and web projects).

这是一个网络数据库回调例程,基于SocketConnection的-This is a network database callback routines, based on the SocketConnection

是用回朔法实现跳马程序。数据结构入门的好例子-is back Schomburg Method vault procedures. Structure data entry a good example

串的KMP算法，无回溯的模式匹配中最具代表性的是KMP算法。它是基于对模式本身的字符分布特征所进行的分析，生成模式的特征向量，显示了P= aab 匹配S= ababbaabaa 的优化的KMP算法过程。-Strings of KMP algorithm, no backtracking pattern matching is the most representative of the KMP algorithm. It is based on a model of their own characters by distribution analysis of eigenvectors generated model shows that P = aab match S = ababbaabaa the KMP algorithm optimization process.