代码搜索:Fast

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

代码结果 10,000
www.eeworm.com/read/260546/11720286

pas fastmm4messages.pas

{ Fast Memory Manager: Messages Simplified Chinese translation by JiYuan Xie. } unit FastMM4Messages; interface {$Include FastMM4Options.inc} const {The name of the debug info
www.eeworm.com/read/260546/11720340

pas fastmm4messages.pas

{ Fast Memory Manager: Messages Simplified Chinese translation by JiYuan Xie. } unit FastMM4Messages; interface {$Include FastMM4Options.inc} const {The name of the debug info
www.eeworm.com/read/156908/11752775

h ebrick2.h

/* * MIRACL C++ Header file ebrick2.h * * AUTHOR : M. Scott * * PURPOSE : Definition of class EBrick2 * Brickell et al's method for fast exponentiation with
www.eeworm.com/read/156908/11753288

cpp modpol.cpp

// // Program to generate Modular Polynomials mod p, as required for fast // implementations of the Schoof-Elkies-Atkins algorithm // for counting points on an elliptic curve Y^2=X^3 + A.X + B mod
www.eeworm.com/read/156908/11753814

c mrebrick.c

/* * Module to implement Brickell et al's method for fast * computation of x*G mod n, for fixed G and n, using precomputation. * * Elliptic curve version of mrbrick.c * * This ide
www.eeworm.com/read/156735/11780455

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/155568/11863021

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/258434/11864732

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/155530/11865650

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)
www.eeworm.com/read/154209/11983186

c chebwinx.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