代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/352774/7131558
c lesson3_2.c
#include
#define uint unsigned int
#define uchar unsigned char
sbit dula=P2^6;
sbit wela=P2^7;
uchar num;
uchar code table[]={
0x3f,0x06,0x5b,0x4f,
0x66,0x6d,0x7d,0x07,
0x7f,0x6f,0
www.eeworm.com/read/152959/7136569
cpp bibaosuanfa.cpp
// Bibaosuanfa.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "iostream.h"
#define max 100
void zifan(int B[][max],char A[max],int n);
void duichen(
www.eeworm.com/read/362924/7139037
m chap2_1.m
%Expert PID Controller
clear all;
close all;
ts=0.001;
sys=tf(5.235e005,[1,87.35,1.047e004,0]); %Plant
dsys=c2d(sys,ts,'z');
[num,den]=tfdata(dsys,'v');
u_1=0;u_2=0;u_3=0;
y_1=0;y_2=0;y_3
www.eeworm.com/read/152244/7139271
m ep8_1.m
%%%%%%%%%%%% Exploratory problem 8.1 %%%%%%%%%%%%
% Discrete-Time Control Problems using %
% MATLAB and the Control System Toolbox %
% by J.H. Chow, D.K. Frederick, & N.W. Chbat %
www.eeworm.com/read/104147/7141364
txt example69token.txt
import java.util.*;
public class TokenApp {
static String str="this is a test";
public static void main(String[] args) {
int num;
StringTokenizer st = new StringTokenizer(st
www.eeworm.com/read/165343/7143888
txt finddfree.cc.txt
// Program: finddfree.cc -- find d_free for a given set of
// connection coefficients.
// (Currently works only for k=1)
// Todd K. Moon
#include
using namespace std;
#include "Bin
www.eeworm.com/read/140797/7146860
c __divdi3.c
/*
* arch/i386/libgcc/__divdi3.c
*/
#include
#include
extern uint64_t __udivmoddi4(uint64_t num, uint64_t den, uint64_t *rem);
int64_t __divdi3(int64_t num, int64_t den)
{
www.eeworm.com/read/140797/7147106
c __divdi3.c
/*
* arch/i386/libgcc/__divdi3.c
*/
#include
#include
extern uint64_t __udivmoddi4(uint64_t num, uint64_t den, uint64_t *rem);
int64_t __divdi3(int64_t num, int64_t den)
{
www.eeworm.com/read/140797/7147109
c __moddi3.c
/*
* arch/i386/libgcc/__moddi3.c
*/
#include
#include
extern uint64_t __udivmoddi4(uint64_t num, uint64_t den, uint64_t *rem);
int64_t __moddi3(int64_t num, int64_t den)
{
www.eeworm.com/read/302940/7148433
m offcp.m
function output=offCP(input,Num);
output=[];
for j=1:26
for i=1:1024
output(i,j)=input(i+Num,j);
end
end