代码搜索：Fast
找到约 10,000 项符合「Fast」的源代码
代码结果 10,000
www.eeworm.com/read/154209/11983839
c chebwin.c
/*
* CHEBWIN Chebyshev window.
* CHEBWIN(N,R) returns the N-point Chebyshev window with R decibels
* of ripple.
*
* Reference: E. Brigham, "The Fast Fourier Transform and its Applicatio
www.eeworm.com/read/153440/12033804
bbl demogng.bbl
\begin{thebibliography}{}
\bibitem[Fritzke, 1994]{Fritzke94a}
Fritzke, B. (1994).
\newblock \htmladdnormallink{Fast learning with incremental {RBF}
networks}{http://www.neuroinformatik.ruhr-uni-boc
www.eeworm.com/read/153440/12033894
bbl images.bbl
\begin{thebibliography}{}
\bibitem[Fritzke, 1994]{Fritzke94a}
Fritzke, B. (1994).
\newblock \htmladdnormallink{Fast learning with incremental {RBF}
networks}{http://www.neuroinformatik.ruhr-uni-boc
www.eeworm.com/read/341877/12057386
h xfile.h
/*
** xfile.h -- definitions for fast line buffered files
*/
#ifndef __XFILE_H__
#define __XFILE_H__
struct _xfile {
int fd;
int bufSize;
char *buf;
char *nextChar;
www.eeworm.com/read/151567/12200448
readme
Directory
../Utilities
Contents
colSum.m
Sums the columns of matrices.
diagProduct.m
Fast way to get the diagonal of the product of two matrices.
dupCol.m
Creates a matrix
www.eeworm.com/read/151555/12201503
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
www.eeworm.com/read/252119/12301438
c tab.c
/*
* Most of the tab routines were gathered into one file. There is an
* assembly routine tdeasm.c that expands tabs. That routine is in
* assembly to keep screen updates fairly fast. (jmh 991202
www.eeworm.com/read/150169/12307837
dpr borlndmm.dpr
{
Fast Memory Manager: Replacement BorlndMM.DLL 1.02
Description:
A replacement borlndmm.dll using FastMM instead of the RTL MM. This DLL may be
used instead of the default DLL together with
www.eeworm.com/read/250172/12426617
c malloc.c
/*
* malloc.c --- a general purpose kernel memory allocator for Linux.
*
* Written by Theodore Ts'o (tytso@mit.edu), 11/29/91
*
* This routine is written to be as fast as possible, so that it
*
www.eeworm.com/read/132000/14116608
h screenfade.h
#if !defined( SCREENFADEH )
#define SCREENFADEH
#ifdef _WIN32
#pragma once
#endif
typedef struct screenfade_s
{
float fadeSpeed; // How fast to fade (tics / second) (+ fade in, - fade out)