电子程序

软件设计文档国家标准 -National standards for software design documents

LED 驱动器AS3693的控制器代码。适合做LED控制的人-spi interface for led driver as3693

一个简单的俄罗斯方块代码，可以实现简单的功能-A simple Tetris code, can achieve a simple function of

密码查看器很厉害哦-password viewer very powerful oh

一的个数阿里山打发六十九地方奥斯陆地方拉可是大家按时道路发生蓝点颏法-hdfkashdfasjfkdfhkajhsdfkaskdfnaklsdfasjdflasjdlfkjs

王金明verilog书中第十章的例子 适合初学者-Wang Jinming verilog example Chapter book for beginners

用于IC设计中，对lef，def等的文件操作-for IC design, the right lef, def operation, the documents

dat文件，是apriori算法所用到的数据集，很多人找，因此上传-dat document is apriori algorithm uses data sets, many people find it uploads

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

资源描述VB6.0  OPC PPI S7-200通讯  Private MyOPCServer As OPCServer        " OPCServer Object Private MyGroups As OPCGroups           " OPCGroups Collection Object Private WithEvents MyGroup As OPCGroup  " OPCGroup Object Private MyItems As OPCItems             " OPCItems Collection Object Private MyItemServerHandles() As Long   " Server Handles for Items Dim MyTID As Long                       " Transaction ID for asynchronous calls