-
If you do not want to use js in the development, or want to alert you can log re...
如果您不想在开发js时用alert或者想把log记录下来您可以在页面上引入文件后写var log =new Log() log.info() log.error() log.warn() 来输出您关心的东西,您将会在您的页面上看到一个窗口,里面记录了你输出的东西-If you do not want to use js in the development, or want to alert you can log recorded on the page after the introduction of paper to write var log = new Log () log.info () log.error () log.warn () to the output you care about things, you will see on your page a window, which records the output of your things
- 2022-05-09 07:39:01下载
- 积分:1
-
保护模式下的8259A芯片编程及中断处理探究_上.pdf
保护模式下的8259A芯片编程及中断处理探究_上.pdf-protected mode under the 8259A chip programming and interrupt handling _ Inquiry on. Pdf
- 2023-07-23 03:25:02下载
- 积分:1
-
osek/vdx汽车电子嵌入式软件编程技术部分资料和原代码5
osek/vdx汽车电子嵌入式软件编程技术部分资料和原代码5-osek/vdx automotive electronics embedded software programming and information technology part of the original code 5
- 2022-03-14 21:43:50下载
- 积分:1
-
it is a good OPENGL book
这是一本非常好的OPENGL的学习的书,介绍的内容丰富,还有各种OPENGL怎么用VC++实现的代码,非常适合学习OPENGL编程的初学者。-it is a good OPENGL book
- 2022-01-26 03:25:29下载
- 积分:1
-
ARM的汇编指令集,对学习ARM汇编初学者很有帮助。
ARM的汇编指令集,对学习ARM汇编初学者很有帮助。-A compilation of ARM instruction set, to be helpful for beginners to learn ARM assembly.
- 2022-08-25 13:01:32下载
- 积分:1
-
think in the first edition (Chinese)
think in java 第一版(中文)-think in the first edition (Chinese)
- 2022-05-07 18:49:14下载
- 积分:1
-
- 2023-07-04 01:40:04下载
- 积分:1
-
Linux commands for study
Linux commands for study
- 2022-03-01 11:14:11下载
- 积分:1
-
: 为了用蚁群算法来解决连续优化问题, 该算法将函数优化问题中生成解的过程转化为蚁群每前进一步就
选择一个十进制数字并以此来生成一个十进制串的过程。...
: 为了用蚁群算法来解决连续优化问题, 该算法将函数优化问题中生成解的过程转化为蚁群每前进一步就
选择一个十进制数字并以此来生成一个十进制串的过程。-: Using ant colony algorithm for continuous optimization problem to solve, the problem of function optimization algorithm will be generated in the process of solution into each and every step on the ant to select a decimal figure and in order to generate a string of decimal process.
- 2022-01-25 18:42:09下载
- 积分:1
-
问题描述:某国家的硬币体系包含N种面值(其中一定有面值为1的),现有一种商品价格为P,最少要用多少枚硬币可以买下...
问题描述:某国家的硬币体系包含N种面值(其中一定有面值为1的),现有一种商品价格为P,最少要用多少枚硬币可以买下-Problem Description: A national system contains N kinds of coins with a face value (which must have a face value of 1), the current price of a commodity for P, at least take the number of coins can be bought
- 2022-01-26 00:20:41下载
- 积分:1