登录
首页 » Windows开发 » 很实用的API实用大全,全面介绍了API函数,介绍详细

很实用的API实用大全,全面介绍了API函数,介绍详细

于 2022-08-26 发布 文件大小:1.43 MB
0 163
下载积分: 2 下载次数: 1

代码说明:

很实用的API实用大全,全面介绍了API函数,介绍详细-very pratical api usage, a thorough introduction to api functions in detail.

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

发表评论

0 个回复

  • contorl panel file demo
    contorl panel file demo
    2022-08-11 07:45:35下载
    积分:1
  • 计算方法,经典代码
    计算方法,经典代码-calculation method, classic code
    2022-01-26 06:19:28下载
    积分:1
  • CCeFileFind
    CCeFileFind - File Finder class for Windows CE-CCeFileFind- File Finder class for Windows CE
    2022-02-05 05:03:38下载
    积分:1
  • 数据包分类 ABV 算法
    这是为数据包分类与 ABV,这是决策树根据的 algorithmthis 方案将划分的规则集到许多组来提高性能的搜索时间
    2023-05-13 08:30:02下载
    积分:1
  • 一个简单的数据库程序
    一个简单的数据库程序-a simple database program
    2022-01-24 19:04:45下载
    积分:1
  • wince implementation for scroll bars
    wince implementation for scroll bars
    2022-02-13 16:39:06下载
    积分:1
  • PID algorithm, the realization of integral, differential, such as phase
    PID算法,实现积分,微分等锁相环的功能,以及相关利用。-PID algorithm, the realization of integral, differential, such as phase-locked loop function, as well as related use.
    2022-03-16 07:51:51下载
    积分:1
  • 一本书上提供的一个线性表的类,感觉不错,我再VC上调试通过了,希望可以有帮助...
    一本书上提供的一个线性表的类,感觉不错,我再VC上调试通过了,希望可以有帮助 -First book to provide a linear form of the class, I feel good, I would like to debug through the VC, and hope to have help
    2023-01-17 10:00:03下载
    积分: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
  • 扩展的编程实例,比较多的程序
    vc++ 的扩展编程的一些实例,比较多的程序-vc expansion of the programming examples, more procedures
    2022-01-31 12:40:27下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载