编译原理中在自下而上分析和优先分析方法中使用的Washall算法...

FastReport®VCL是一个附加组件，它允许您的应用程序快速有效地产生报表。 FastReport®提供了所有必要的发展报告，其中包括一个可视化的报表设计器，报告的核心，和预览窗口的工具。它可以在Embarcadero公司（原Borland和CodeGear公司）的Delphi7 XE7和C ++ Builder2005 XE7使用。

SetCursor CWnd LoadCursor DestroyWindow CDialog GetClientRect C Button GetStockObject CFont GetWindowLong SetWindowLong GetWindowRect BeginDeferWindowPos EnableWindow DeferWindowPos EndDeferWindowPos InvalidateRect UpdateWindow GetCursorPos CPoint SetCapture GetCapture ReleaseCapture CallWindowProc CPaintDC DrawEdge PtInRect SetFocus CMenu-SetCursor CWnd LoadCursor DestroyWindow CDialog GetClientRect C Button GetStock Object CFont GetWindowLong SetWindowLong Get WindowRect BeginDeferWindowPos EnableWindo w DeferWindowPos EndDeferWindowPos Invalida teRect UpdateWindow GetCursorPos CPoint SetC apture GetCapture ReleaseCapture CallWindow Proc CPaintDC DrawEdge PtInRect SetFocus CMen u

files useful about dsp programme

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

这个源代码是二进制，八进制，十进制数字之间的互相转换。

C++ Builder程序员学习数据结构第4章-Builder C programmers to learn data structure Chapter 4

数据库654 521654321654132-shujuku

This program demonstrates how to do disconnected briefcase applications with ADO. When the Connected checkbox is unchecked the application is switched into offline mode. If the application is exited at that point then the data is persisted to a file on disk (along with any edits to the data). When the application is restarted it will load the persisted data if present, otherwise it will fetch the data from the database.

Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!

北京邮电大学软件工程研究生的课程---数据库设计开发-0-1.1.ppt ... 北京邮电大学软件工程研究生的课程---数据库设计开发-5.2.ppt-Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-0-1.1.ppt ... Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-5.2.ppt