一个朋友管理系统,让你对朋友的点滴都可以记载在上面,以方便以后查看!...

摘要 　? 　? 　　 　　设计时的自动化加快了编码，并保证所有过程都用相同的命名规范和结构来生成。为了在大型 SQL 项目中尽量提高编码的效率，作者编写了一系列的设计时（design-time）存储过程，用它们来生成运行时（run-time）存储过程，并一直在工程中使用。最近，作者更新了其存储过程以便使用 SQL Server 2000 的特性，其中包括用户定义函数。本文所及内容涵盖创建并执行这些动态 T-SQL 脚本以使普通的数据库存储过程编码自动化。- Time the abstract design automation sped up the code, and guarantee all processes all use the same naming standard and the structure produce. In order to enhances the encoded efficiency as far as possible in the large-scale SQL project, the author has compiled when a series of designs (design-time) saves the process, produces when the movement with them (run-time) saves the process, and always uses in the project. Recently, the author renewed its memory process in order to use SQL the Server 2,000 characteristics, including user definition function. This article institute and the content cover founds and carries out these dynamic T-SQL script to cause the ordinary database memory process code automation.

SELECT "*" AS RecID, "(All)" AS Employee FROM Employees AS T1 UNION SELECT T1.EmployeeID AS RecID, [FirstName] & " " & [LastName] AS Employee FROM Employees AS T1 ORDER BY Employee;

基于c语言和数据库的小型医院管理

Delphi 2007 Remobjects分布式ERP模型-Delphi 2007 Remobjects Distributed ERP model

一个电力企业的后台管理程序，请大家笑纳-The background of a power enterprise management process, please笑纳

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

对N皇后问题进行优化，可以在较短时间内计算出皇后排列方法的个数-Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered

解N元一次方程，从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。-Solution of N-linear equation, reading from a file into an integer N, and then read into the N* (N+1) matrix obtained solution and the output to a file.

数据结构算法，三跑道飞机场模拟。 主要是队列的算法 内容包括: 实验报告 源码工程文件-Data structure algorithms, three runway airport simulation. The algorithm is mainly queue includes: experimental report source project file

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.