登录
首页 » Delphi » BiosHelp

BiosHelp

于 2020-06-24 发布
0 202
下载积分: 1 下载次数: 1

代码说明:

说明:  BiosHelp.pas initially started as help for one developer who wants to read the ROM-BIOS on Windows NT (one of the common questions on message boards). Since BiosHelp and my ROM-BIOS related code starts growing (e.g. SMBIOS) - I finally decided to change the names of the functions, types, and consts in Version 2.0 to be able to extend this packages without name/sense conflicts. Sorry for any circumstances - it will be the last major change for long time.

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

发表评论

0 个回复

  • src
    银行管理程序,实现简单管理员删户开户,转账等功能(Bank management program)
    2013-05-28 13:54:49下载
    积分:1
  • 智能家居
    说明:  智能家居控制,传感器搭配使用,方便快捷实惠(Smart home control, sensor collocation, convenient, fast and affordable)
    2020-06-24 18:40:02下载
    积分:1
  • WSN_localization_simulator
    Light weight WSN simulator with attacks and defences.
    2017-11-01 03:49:02下载
    积分:1
  • Processor system pratice
    说明:  处理器系统,包括创建进程(QQ)、枚举进程、自定义消息发送、共享内存、线程同步等功能,有MFC界面(Processor system, including create process (QQ), enumeration process, custom message sending, shared memory, thread synchronization and other functions, with MFC interface)
    2020-11-14 22:49:37下载
    积分:1
  • vec
    A simple vector operation class and header
    2009-04-22 00:13:18下载
    积分:1
  • NLM2_1_.if12
    说明:  利用PSCAD搭建的NLM调制的MMC模型(NLM Modulation Model Based on PSCAD)
    2021-01-18 11:08:43下载
    积分:1
  • 用灰色预测理论实现负荷预测,可以任意取点
    用灰色预测理论实现负荷预测,可以任意取点-Gray prediction theory to achieve load forecasting, you can take an arbitrary point
    2022-01-24 15:32:56下载
    积分:1
  • 编写一个Java程序,用于输出Fibonacci数列的前20项。 提示:Fibonacci数列定义为:第一、二项的值为1,从第三项开始依次为前两项的和。...
    编写一个Java程序,用于输出Fibonacci数列的前20项。 提示:Fibonacci数列定义为:第一、二项的值为1,从第三项开始依次为前两项的和。 Fibonacci[0]=Fibonacci[1]=1 Fibonacci[i]=Fibonacci[i-2]+Fibonacci[i-1] (i>=2) -Write a Java program for Fibonacci series, the first output 20. Tip: Fibonacci sequence is defined as: first, two of the value of 1, starting from the third and was followed by the first two. Fibonacci [0] = Fibonacci [1] = 1 Fibonacci [i] = Fibonacci [i-2]+ Fibonacci [i-1] (i> = 2)
    2023-03-11 04:55:03下载
    积分:1
  • hello h5
    移动端使用,具有很多的功能,方便调用,推荐给使用(Mobile terminal, with many functions, easy to call, recommended for use)
    2020-06-23 06:20:02下载
    积分:1
  • 1
    说明:  以3月5日为例,应该先把前两个月的加起来,然后再加上5天即本年的第几天,特殊        情况,闰年且输入月份大于3时需考虑多加一天。(To March 5, for example, should the first two months of the combined first and then add the 5th day of the first few days of this year, special circumstances, a leap year and enter the 3 months to consider more than one day.)
    2010-09-10 11:17:21下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载