代码搜索：Simple
找到约 10,000 项符合「Simple」的源代码
代码结果 10,000
www.eeworm.com/read/164050/10133767
m exm0611_4.m
%exm0611_4.m 用符号计算验证三角等式 。
syms fai1 fai2;
y=simple(sin(fai1)*cos(fai2)-cos(fai1)*sin(fai2))
www.eeworm.com/read/164050/10133828
m exm0634_1.m
%exm0634_1.m
syms T t tao;
ut=exp(-t);
ht=exp(-t/T)/T;
uh_tao=subs(ut,t,tao)*subs(ht,t,t-tao);
yt=int(uh_tao,tao,0,t);
yt=simple(yt)
www.eeworm.com/read/163643/10151910
m time_fun_s.m
function y=time_fun_s(t)
syms a a1
T=5;a=T/2;
y1=sym('Heaviside(t+a1)'*(2*t/a1+1))+sym('Heaviside(t-a1)'*(2*t/a1-1))
y=y1-sym('Heaviside(t)'*(4*t/a1))
y=subs(y,a1,a);
y=simple(y);
www.eeworm.com/read/358861/10177671
m gen_figure.m
function void = gen_figure (what);
%GEN_FIGURE Generate figures for fit-ell-lsq
%
% produces figure for 'what'. (named .ps)
%
if (nargin < 1), what = []; end;
if (what == []), what = str2ma
www.eeworm.com/read/160819/10496246
cpp polydemo.cpp
#include
using namespace std;
#include "poly.h"
// simple demo of polynomials
int main()
{
Poly p1, p2, p3;
p1 = Poly(5,7) + Poly(4,2) + Poly(3,1) + Poly(2,0);
www.eeworm.com/read/352806/10505011
y tiny.y
/****************************************************/
/* File: tiny.y */
/* The TINY Yacc/Bison specification file */
/* Compiler Construction: Princi
www.eeworm.com/read/278472/10533899
c cursor.c
/***************************************************************
* *
* Copyright (c) 2001-2007 McObject LLC. All Right Reserved. *
*
www.eeworm.com/read/278332/10545850
qmsg top.fit.qmsg
{ "Info" "IQEXE_SEPARATOR" "" "Info: *******************************************************************" { } { } 3}
{ "Info" "IQEXE_START_BANNER_PRODUCT" "Fitter Quartus II " "Info: Running Quartu
www.eeworm.com/read/278332/10546083
qmsg top.tan.qmsg
{ "Info" "IQEXE_SEPARATOR" "" "Info: *******************************************************************" { } { } 3}
{ "Info" "IQEXE_START_BANNER_PRODUCT" "Timing Analyzer Quartus II " "Info: Runni
www.eeworm.com/read/422934/10600473
h simplecrobot.h
/*----------------------------------------------------------------------------*/
/* Copyright (c) FIRST 2008. All Rights Reserved. */
/* Open Source Software - may be modified and shared by