代码搜索：source
找到约 10,000 项符合「source」的源代码
代码结果 10,000
www.eeworm.com/read/470167/6914428
h source.h
#define MAXINPUT 30
typedef struct Poly{
int Coef;
int Expo;
Poly *next;
};
typedef struct Poly node;
typedef node *link;
link ptr=NULL,ANS=NULL,head=NULL,headA=NULL,headB=NULL,Wor
www.eeworm.com/read/146545/6956205
m source.m
function data = source(fr_length,frames,md,zf,varargin)
%SOURCE Generate source data.
% D = SOURCE(K,F,MD,ZF) creates a data source consists of desired
% number of F frames each having K symbols.
www.eeworm.com/read/469354/6973368
zip source.zip
www.eeworm.com/read/468242/6995562
h source.h
extern char filter_1(void);
extern char filter_2(void);
extern char filter_3(void);
extern char filter_4(void);
extern char filter_5(void);
extern char filter_6(void);
extern char filter_7(void)
www.eeworm.com/read/467625/7006132
zip source.zip
www.eeworm.com/read/465945/7049250
txt source.txt
标准的PID处理例程
--- 工业控制中常用算法 ---
/*====================================================================================================
这是从网上找来的一个比较典型的PID处理程序，在使用单片机作为控制cpu时，请稍作简化，具
www.eeworm.com/read/144635/7094629
zip source.zip
www.eeworm.com/read/463601/7177599
cpp source.cpp
#include
int main(int argc,char*argv[])
{
int arry[30];
for(int i=0;i0 && arry[i]
www.eeworm.com/read/461501/7226401
cpp source.cpp
/**
* Title CLOCK.cpp
*
* Created on 2009-3-30
* @Author ShaunChxion
* @Email shaunchyxion@163.com
* @Shaun All Rights reserved.
*
*/
/*******************************************
www.eeworm.com/read/461420/7227902
cpp source.cpp
//先序遍历二叉树的非递归算法
#include
#include
typedef struct node
{
char data;
struct node *lchild,*rchild;
}BinTNode;
typedef BinTNode *BinTree;
int count;
#define SSize 10