登录
首页 » Windows开发 » 一个用于制作Microsoft Word插件的小程序,使用Delphi语言开发

一个用于制作Microsoft Word插件的小程序,使用Delphi语言开发

于 2022-03-26 发布 文件大小:42.47 kB
0 171
下载积分: 2 下载次数: 1

代码说明:

一个用于制作Microsoft Word插件的小程序,使用Delphi语言开发-a Microsoft Word for the production of small plug-in procedures, the use of Delphi language

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • C-mex files for MATLAB encounter the following problem when compiling them with WATCOM 11.0: All access-functions to files (fprintf, fscanf) cannot handle double variables, only integer and strings are read or written correctly. The file convert.c contains two functions: You may read a double-variable as a string from the file and convert it to a double (function string2double) and you may convert a double to a string (function double2string) and write it to a file (see main() in convert.c). The file conditio.dat is an example of numbers read by convert.c. The conv.exe was compiled on a Windows95-system. The files were tested for MATLAB 5.2 and WATCOM 11.0a result of "ver" is: MATLAB Version 5.2.1.1420 on PCWIN-C-mex files for MATLAB encounter the following problem when compiling them with WATCOM 11.0: All access-functions to files (fprintf, fscanf) cannot handle double variables, only integer and strings are read or written correctly. The file convert.c c
    2022-06-01 01:50:17下载
    积分:1
  • Using a simple calculator written in VC
    用VC 编写的简单的计算器,基于对话框的应用程序 -Using a simple calculator written in VC-based dialog application
    2023-09-09 03:30:04下载
    积分:1
  • vb反弹连接源码 vb source code rebound Connection
    vb反弹连接源码 vb source code rebound Connection-vb source code rebound to connect vb source code rebound Connection
    2022-05-08 12:55:58下载
    积分:1
  • K r u s k a l算法每次选择n
    K r u s k a l算法每次选择n- 1条边,所使用的贪婪准则是:从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步,其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边,每次考虑一条边。当考虑某条边时,若将其 加入到已选边的集合中会出现环路,则将其抛弃,否则,将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
    2023-02-08 08:10:04下载
    积分:1
  • This article is in the XNA development platform to use c# development of a learn...
    本文是在XNA开发平台上用c#开发的一个学习程序,主要是为初学者参考-This article is in the XNA development platform to use c# development of a learning process, the main reference for beginners
    2022-04-16 11:24:51下载
    积分:1
  • 能做出各种各样的按钮的源码,可以自画,学习界面编程有一定的帮助...
    能做出各种各样的按钮的源码,可以自画,学习界面编程有一定的帮助-A variety of buttons to make the source code, you can draw from to learn programming interface must have the help of
    2022-09-05 12:10:02下载
    积分:1
  • Factor factor[简明英汉词典] [ˈ fæ ktə ] n. 1 因素, 要素 2 〈数〉因子, 因数...
    Factor factor[简明英汉词典] [ˈ fæ ktə ] n. 1 因素, 要素 2 〈数〉因子, 因数 词条指正 - Google 搜索 -Factor factor[简明英汉词典] [ˈ fæ ktə ] n. 1 因素, 要素 2 〈数〉因子, 因数 词条指正- Google 搜索
    2022-02-05 09:29:28下载
    积分:1
  • simple cad program by vc.
    基于VC6.0开发工具开发的简易CAD程序-simple cad program by vc.
    2023-02-14 00:00:03下载
    积分:1
  • pocketc查询形近词的源码,大家下载
    pocketc查询形近词的源码,大家下载-pocketc query shape near term source
    2023-07-14 07:30:03下载
    积分:1
  • 光学字符识别
    OCR libary ,光学字符识别
    2022-01-26 06:35:28下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载