-
摩托罗拉S记录生成模块
Python模块生成摩托罗拉S记录文件。搜索发电机类支持16，24，和32位地址（S1 / S9中，S2 / S8中，和S3/ S7记录类型）。支持S5（和建议（？）S6）记录计数类型。数据可以被添加作为一个字符串的十六进制字符，十六进制字符对的列表，或整数列表（在0至255的范围内）。使用srecutils模块写加布里埃尔特伦布莱。
- 2023-04-16 07:10:03下载
- 积分：1
-
用C#编写的智能农业控制系统
资源描述用C#编写的智能农业控制系统，具有实时监控反馈，智能调控，人工调控等功能-
- 2022-02-21 14:59:07下载
- 积分：1
-
C编程的格式，对养成良好的变成习惯非常有帮助。经典文档之一...
C编程的格式，对养成良好的变成习惯非常有帮助。经典文档之一
- 2022-03-23 14:09:13下载
- 积分：1
-
本文简要的想法给开发者，帮助他们选择C #或VB…
This document give brief idea to the developers and help them to choose C# or VB which both are supported by Microsoft .Net platform. One this document is read one can make focus on the technology suites their ski-This document give brief idea to the developers and help them to choose C# or VB which both are supported by Microsoft .Net platform. One this document is read one can make focus on the technology suites their skill
- 2023-01-09 07:05:04下载
- 积分：1
-
ess hard disk players some very useful documents
ess硬盘播放机的一些很有用的文档 -ess hard disk players some very useful documents
- 2022-04-17 20:59:27下载
- 积分：1
-
bootloader精讲ARM芯片非常详细的注解
bootloader精讲ARM芯片非常详细的注解-Bootloader Intensive ARM chip very detailed notes
- 2022-03-28 13:33:35下载
- 积分：1
-
在include/adm/io.h里定义。
inb_p()、outb_p()与inb()、outb_p()的不同在于前者在存取I/O时有等待(pause)...
在include/adm/io.h里定义。
inb_p()、outb_p()与inb()、outb_p()的不同在于前者在存取I/O时有等待(pause)一适应慢速的I/O设备。
-the include/adm/io.h Lane definition. Inb_p (), outb_p () and quick (), outb_p () different is that the former access to the I/O wait time (pause) a slow adaptation of the I/O equipment.
- 2023-04-22 17:45:03下载
- 积分：1
-
国家标准－计算机软件配置管理计划规范
国家标准－计算机软件配置管理计划规范-national standard-Computer Software Configuration Management Initiative Specification
- 2022-02-02 06:38:45下载
- 积分：1
-
Software Estimation : Demystifying the Black Art assessment software
Software Estimation: Demystifying the Black Art
软件评估-Software Estimation : Demystifying the Black Art assessment software
- 2022-01-22 07:35:48下载
- 积分：1
-
seeking maze exports from the entrance to the path of all the procedures for a c...
求迷宫中从入口到出口的所有路径是一个经典的程序设计问题。由于计算机解迷宫室，通常用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向在继续探索，直到所有可能的通路都探索到为止。为了保证在任何位置上都能沿原路返回，显然需要用一个后进先出的结构来保存从入口到当前位置的路径。因此，在球迷宫通路的算法中应用“栈”也就是自然而然的事了。 -seeking maze exports from the entrance to the path of all the procedures for a classic design problem. The computer maze room, normally used was "exhaustive solution" approach, that is, from the entrance, with a direction to explore, if we can follow links, will continue to move forward; Otherwise, return along the same route, a direction for the continued exploration and until all possible pathway to date has explored. To ensure that in any position along the same route can return, obviously need a last-in, first-out to preserve the structure from the entrance of the current location of the path. Therefore, in the Palace fans access algorithm application "stack" is naturally a thing of the past.
- 2022-06-15 15:18:08下载
- 积分：1
