代码搜索：Fast
找到约 10,000 项符合「Fast」的源代码
代码结果 10,000
www.eeworm.com/read/352754/10515019
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 i
www.eeworm.com/read/352327/10563477
c nfft.c
/**
* Library.
* Includes simple and fast computation of the NDFT (direct problem) as well
* as (iterative) solution to the inverse problem.
* authors: D. Potts, S. Kunis (c) 2002-2005
*/
#inclu
www.eeworm.com/read/422976/10596240
pas fastmm4messages.pas
{
Fast Memory Manager: Messages
English translation by Pierre le Riche.
}
unit FastMM4Messages;
interface
{$Include FastMM4Options.inc}
const
{The name of the debug info suppor
www.eeworm.com/read/350890/10700159
spec fastdb.spec
Summary: Fast In-Memory RDBMS
Name: fastdb
Version: 3.02
Release: 1.%{?_vendorsuffix:%{_vendorsuffix}}%{!?_vendorsuffix:%{_vendor}}
Copyright: BSD
Group: Development/Libraries
URL: http://www.ispras.r
www.eeworm.com/read/350219/10757893
txt readme_txt.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/350219/10757904
txt readme_txt.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/349903/10785430
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
www.eeworm.com/read/349903/10785494
cpp ebrick.cpp
/*
* Test program 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 cert
www.eeworm.com/read/349903/10785533
cpp brick.cpp
/*
* Test program 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 cert