代码搜索:Fast

找到约 10,000 项符合「Fast」的源代码

代码结果 10,000
www.eeworm.com/read/371050/9570203

c parser.c

/** SFSEXP: Small, Fast S-Expression Library version 1.0 Written by Matthew Sottile (matt@lanl.gov) Copyright (2004). The Regents of the University of California. This material was produced under U
www.eeworm.com/read/371050/9570207

h faststack.h

/** SFSEXP: Small, Fast S-Expression Library version 1.0 Written by Matthew Sottile (matt@lanl.gov) Copyright (2004). The Regents of the University of California. This material was produced under U
www.eeworm.com/read/371050/9570210

c cstring.c

/** SFSEXP: Small, Fast S-Expression Library version 1.0 Written by Matthew Sottile (matt@lanl.gov) Copyright (2004). The Regents of the University of California. This material was produced under U
www.eeworm.com/read/371050/9570213

h sexp.h

/** SFSEXP: Small, Fast S-Expression Library version 1.0 Written by Matthew Sottile (matt@lanl.gov) Copyright (2004). The Regents of the University of California. This material was produced under U
www.eeworm.com/read/371050/9570216

c faststack.c

/** SFSEXP: Small, Fast S-Expression Library version 1.0 Written by Matthew Sottile (matt@lanl.gov) Copyright (2004). The Regents of the University of California. This material was produced under U
www.eeworm.com/read/366193/9825521

c hello_world.c

/* * "Hello World" example. * * This example prints 'Hello from Nios II' to the STDOUT stream. It runs on * the Nios II 'standard', 'full_featured', 'fast', and 'low_cost' example * desi
www.eeworm.com/read/169968/9829367

h fftstruc.h

/* * Fast Fourier Transform structure definition * Copyright (C) ARM Limited 1998-1999. All rights reserved. */ #ifndef _FFTSTRUC_ #define _FFTSTRUC_ #ifndef _COMPLEX #define _COMPLEX
www.eeworm.com/read/366065/9833778

c tclmacalloc.c

/* * tclMacAlloc.c -- * * This is a very fast storage allocator. It allocates blocks of a * small number of different sizes, and keeps free lists of each size. * Blocks that don't exactly fit ar
www.eeworm.com/read/362500/9995935

m fastnnls.m

function b = fastnnls(x,y,tol,b) %FASTNNLS Fast non-negative least squares % The inputs are the matrix of predictor variables (x), % vector of predicted variable (y), and optional inputs % tole
www.eeworm.com/read/164554/10103427

m chebdifft.m

function Dmf = chebdifft(f,M) % The function Dmf = chebdifft(f,M) computes the M'th % approximate Chebyshev derivatives of the data vector y. % A Fast Fourier Transform is used compute the Chebyshev