代码搜索：same
找到约 10,000 项符合「same」的源代码
代码结果 10,000
www.eeworm.com/read/134379/13994111
h ip_conntrack_tuple.h
#ifndef _IP_CONNTRACK_TUPLE_H
#define _IP_CONNTRACK_TUPLE_H
/* A `tuple' is a structure containing the information to uniquely
identify a connection. ie. if two packets have the same tuple, they
www.eeworm.com/read/133537/14036719
license
web-FTP is Copyright 1999 The Math Forum (http://www.mathforum.com)
web-FTP may be redistributed and/or modified under the same terms as the
version 5.004 implementation of the Perl programming langu
www.eeworm.com/read/235612/14061281
m strmatfind.m
function ind=strmatfind(smat,s)
% ind=strmatfind(smat,s)
%
% STRMATFIND searches a string matrix, smat, for a row whos contents
% contain the same string as s. ind is returned as a vector of row
% nu
www.eeworm.com/read/205036/15328788
m times.m
function Z = times(X,Y)
%TIMES Array multiplication for tensors.
%
% TIMES(A,B) is called for the syntax 'A .* B' when A or B is a
% tensor. A and B must have the same size, unless one is a scala
www.eeworm.com/read/205036/15328793
m minus.m
function Z = minus(X,Y)
%MINUS Binary subtraction (-) for tensors.
%
% MINUS(A,B) is called for the syntax 'A - B' when A or B is a tensor. A
% and B must have the same size, unless one is a scala
www.eeworm.com/read/205036/15328896
m rdivide.m
function C = rdivide(A,B)
%RDIVIDE Array right division for sparse tensors.
%
% RDIVIDE(A,B) is called for the syntax 'A ./ B' when A or B is a sparse
% tensor. A and B must have the same size, un
www.eeworm.com/read/205036/15328990
m minus.m
function C = minus(A,B)
%MINUS Binary subtraction for ktensor.
%
% C = MINUS(A,B) computes C = A - B. A and B must both be ktensors
% and have the same size, and the result is another ktensor o
www.eeworm.com/read/204851/15332807
html tab2_1.html
FadeComponent with the following
configuration. (Same as Demo 1)
www.eeworm.com/read/204851/15332808
html tab3_2.html
Two FadeComponents, of the same size, overlap each other,
but animate in the opposite style to create an effect common seen in video
www.eeworm.com/read/202680/15375883
m ffttx.m
function y = ffttx(x)
%FFTTX Textbook Fast Finite Fourier Transform.
% FFTTX(X) computes the same finite Fourier transform as FFT(X).
% The code uses a recursive divide and conquer algorithm fo