代码搜索:Fast

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

代码结果 10,000
www.eeworm.com/read/475731/6776764

readme

KISS FFT - A mixed-radix Fast Fourier Transform based up on the principle, "Keep It Simple, Stupid." There are many great fft libraries already around. Kiss FFT is not trying to be better than
www.eeworm.com/read/295038/8189319

fr3 123.fr3

www.eeworm.com/read/194581/8190364

h xfermem.h

/* xfermem: unidirectional fast pipe copyright ?-2006 by the mpg123 project - free software under the terms of the LGPL 2.1 see COPYING and AUTHORS files in distribution or http://mpg123.de initi
www.eeworm.com/read/194581/8190471

c xfermem.c

/* xfermem: unidirectional fast pipe copyright ?-2006 by the mpg123 project - free software under the terms of the LGPL 2.1 see COPYING and AUTHORS files in distribution or http://mpg123.de initi
www.eeworm.com/read/392526/8338125

c inffast.c

/* inffast.c -- process literals and length/distance pairs fast * Copyright (C) 1995-2002 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zut
www.eeworm.com/read/172783/9691065

c inffast.c

/* inffast.c -- process literals and length/distance pairs fast * Copyright (C) 1995-2002 Mark Adler * For conditions of distribution and use, see copyright notice in zlib.h */ #include "zut
www.eeworm.com/read/172054/9725087

txt readme.txt

DAVICOM Semiconductor Inc. 05/16/2003 A Davicom DM9000 fast ethernet driver for Linux. Copyright (C) 1997 Sten Wang This program is free software; you can redistr
www.eeworm.com/read/172024/9726253

txt readme.txt

DAVICOM Semiconductor Inc. 04/28/2004 A Davicom DM9000 fast ethernet driver for Linux. Copyright (C) 1997 Sten Wang This program is free software; you can redistr
www.eeworm.com/read/170872/9782864

spec fastdb.spec

Summary: Fast In-Memory RDBMS Name: fastdb Version: 3.28 Release: 1.%{?_vendorsuffix:%{_vendorsuffix}}%{!?_vendorsuffix:%{_vendor}} Copyright: BSD Group: Development/Libraries URL: http://www.fastdb.o
www.eeworm.com/read/170565/9798192

c mrbrick.c

/* * Module to implement Brickell et al's method for fast * computation of g^x mod n, for fixed g and n, using precomputation. * This idea can be used to substantially speed up certain ph