PCRE 开源的Regular Expression 源代码,Perl 流派

显示当前系统支持的各种分辨率-Show various kinds of resolution supported in the current system

转载只是说明该程序很高-reproduced only to illustrate the procedure high

本程序用于列出当前所有进程的全路径名，然后输出-The procedures for all processes listed in the current full-path name, and then output

windows 2000下的虚拟打印程序，可以实现多种格式到位图文件的转换-under the Virtual Print procedures, in place to achieve a variety of map file format conversion

INA128和INA129是低功耗高精度的通用仪表放大器-INA128/INA129DATASHEET

extern bool    buy                  = true;        //疣琊屮栩?buy extern bool    sell                 = true;        //疣琊屮栩?sell extern int     StepB                = 10;          //?Buy 铕溴痤?extern int     StepS                = 10;          //?Sell 铕溴痤?extern double  CloseProfitB         = 100;         //玎牮囹?buy 镱 耋祆囵眍祗 镳铘栩?extern double  CloseProfitS         = 100;         //玎牮囹?sell 镱 耋祆囵眍祗 镳铘栩?extern double  CloseProfit          = 10;          //玎牮囹?怦?镱 耋祆囵眍祗 镳铘栩?extern double  LotB   &nb

由用户输入系统进程数(最多50个进程)来模拟优先级调度算法假设进程是同时到达CPU，进程运行时间(1-10秒)和进程优先级 (1-10，10最高1最低)由程序随机产生，进程有2种状态就绪状态（Ready）和完成状态(Complete)首先根据优先级对进程进行排序，再根据优先级分配时间片运行每次分给进程的时间片为1秒，运行完后需运行时间减1优先级减1转下一个进程。如果进程已经完成就插入到完成队列，如果没有完成就重新插入到就绪队列中的正确位置 程序有两种运行方式： 1、可以直接给出最后的运行结果，进程最后的优先级、 运行完每一个进程的时间及完成进程的总时间，进程最后的状态。 2、可以选择自动运行，过程中显示每一次调度信息包括本次调度进程完成队列信息就绪队列信息等*/ -Process user input from a number of systems (up to 50 processes) to simulate priority scheduling algorithm is the assumption that the process of arrival at the same time CPU, the process of run-time (1-10 seconds) and the process priority class (1-10,10 highest minimum 1) randomly generated by the process, the process has two kinds of status status ready (Ready) and achieve status (Complete) First of all, the process in accordance with the priority ranking, and distribution in accordance with the priority of each time slice to run to the process time slice for the second one, to be run after run-time priority class minus one minus one to t

DSP编程常用函数 double uniform(double a,double b,long int* seed) double gauss(double mean,double sigma,long int *seed) double exponent(double beta,long int *seed) double laplace(double beta,long int* seed) double rayleigh(double sigma,long int *seed) double weibull(double a,double b,long int*seed) int bn(double p,long int*seed) int bin(int n,double p,long int*seed) int poisson(double lambda,long int *seed) void dft(double x[],double y[],double a[],double b[],int n,int sign) void fft(double x[],double y[],int n,int sign)-DSP programming functions commonly used double uniform (a double, double b, long int* seed) double Gauss (double mean, double sigma, long int* seed) double exponent (double beta, long int* seed) double Laplace (double beta,* long int seed) double Rayleigh (double sigma, long int* seed) double Weibull (a double, double b, long int* seed) int bn (double p, long int* seed) int bin (int n, p double, seed long int*) int poisson (double lambda, long int* seed) void dft index (doubl

一个有意思的小程序 可以哄MM开心-an interesting small programs can coax MM happy

数据结构中的树形结构的层序遍历，仅仅是是对树的创建，销毁，遍历，插入等常规操作的c源代码-Data structure in the tree structure traversal sequences, only yes yes right tree creation, destruction, traversal, insertion and other conventional operations c source code