-
这个过程演示了如何在运行中使用编辑器
本程序演示了如何使用编辑器在运行期设置表格的一些常用参数
需要使用到Ehlib控件,最好使用3.6版本,旧版本也适用!
使用前请双击本目录下的DB.UDL连接数据库,连接完成后即可选择数据表进行演示!
在表格上按右键,即可出现功能菜单,点击进入!
程序应该适用于各版本的DELPHI,但由于条件有限未做测试!-This procedure demonstrates how to use the editor in the run-time set up tables need to use some common parameters to Ehlib control, it is best to use 3.6 version, also applies to older versions! Before use double-click the catalog under DB.UDL connect to database, connectivity be able to choose after the completion of data table demo! Right-click in the table can function menu appears, click to enter! procedure should be applicable to all versions of DELPHI, but due to limited testing done!
- 2022-01-26 04:00:07下载
- 积分：1
-
image存取到SQL
image存取到SQL，图片格式文件直接存储到SQL数据库中，支持JPEG，BMP等格式
- 2022-08-11 11:53:00下载
- 积分：1
-
实现一个B*Tree的添加和查找，输入数据为一组字典文件
实现一个B*Tree的添加和查找，输入数据为一组字典文件-achieve a B* Tree Search and the addition, the input data for a group of documents dictionary
- 2022-01-25 20:47:50下载
- 积分：1
-
杭州电子科技大学ACM
杭州电子科技大学ACM-OJ系统的部分代码，对学习数据结构还有算法很有帮助-Hangzhou University of Electronic Science and Technology ACM-OJ part of the system code, data structure of the learning algorithm was also very helpful
- 2022-03-01 00:53:45下载
- 积分：1
-
离散事件模拟程序，以及自定义数据类型的队列实现
离散事件模拟程序，以及自定义数据类型的队列实现-Discrete event simulation program, as well as custom data types of queues to achieve
- 2023-01-09 11:50:03下载
- 积分：1
-
jsp+oracle的简单留言本，使用jdbc连接数据库
jsp+oracle的简单留言本，使用jdbc连接数据库-jsp+ oracle simple message of this, use jdbc to connect database
- 2022-05-23 08:41:43下载
- 积分：1
-
car park management system, more complex, for your study reference!
停车场管理系统，比较复杂，供大家学习参考！-car park management system, more complex, for your study reference!
- 2022-03-09 17:37:13下载
- 积分：1
-
如果要连接的数据库文件和当前文件在同一个目录下
如果要连接的数据库文件和当前文件在同一个目录下-If you want to connect to the database file and the current document in the same directory
- 2023-03-17 20:05:04下载
- 积分：1
-
Description of the problem: Given n
问题描述：
给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。
编程任务
对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.
- 2022-04-30 14:06:05下载
- 积分：1
-
This is a classic look for the nearest point of the algorithm, using VC preparat...
这是一个经典的寻找最近点对的算法实现，运用VC编写，采用类的方式，是程序更易理解。-This is a classic look for the nearest point of the algorithm, using VC preparation, the type used, the way the process easier to understand.
- 2022-02-05 11:01:24下载
- 积分：1
