代码搜索：Fast
找到约 10,000 项符合「Fast」的源代码
代码结果 10,000
www.eeworm.com/read/318176/13484197
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/310212/13654670
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
www.eeworm.com/read/310212/13654904
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/309649/13667505
c rg_ssort.c
/* +++Date last modified: 05-Jul-1997 */
/*
** ssort() -- Fast, small, qsort()-compatible Shell sort
**
** by Ray Gardner, public domain 5/90
*/
#include
#include "snipsor
www.eeworm.com/read/309173/13680245
c tutorial04.c
// tutorial04.c
// A pedagogical video player that will stream through every video frame as fast as it can,
// and play audio (out of sync).
//
// Code based on FFplay, Copyright (c) 2003 Fabrice Bell
www.eeworm.com/read/309173/13680254
c tutorial03.c
// tutorial03.c
// A pedagogical video player that will stream through every video frame as fast as it can
// and play audio (out of sync).
//
// Code based on FFplay, Copyright (c) 2003 Fabrice Bella
www.eeworm.com/read/306793/13737635
c ufft.c
/*
* fft.c
*
* Unix Version 2.4 by Steve Sampson, Public Domain, September 1988
*
* This program produces a Frequency Domain display from the Time Domain
* data input; using the Fast Fourier Tra
www.eeworm.com/read/305575/13765654
m jlab_changes.m
% JLAB_CHANGES Changes to JLAB in each release.
%
% Changes new in version 0.85 (Current release)
%
% New functions
%
% fastcontour - Lightning-fast "fake" contouring for large matrices.
% w
www.eeworm.com/read/150892/5687849
h fsqrt.h
#ifndef FSQRT_H
#define FSQRT_H
// Fast square root with integers
int FSqrt(unsigned int l2, int& shift);
#endif //FSQRT_H