代码搜索:Fast
找到约 10,000 项符合「Fast」的源代码
代码结果 10,000
www.eeworm.com/read/124745/6040761
c cache.c
/*
* cache.c Offers ability to cache /etc/group, /etc/passwd,
* /etc/shadow,
*
* All users in the passwd/shadow files are stored in a hash table.
* the hash lookup is VERY fast, generally
www.eeworm.com/read/124443/6047548
h log_coll.h
/*
Copyright (c) 2002, Thomas Kurschel
Part of Radeon driver
Fast logger
As syslog is very slow and tends to loose
data if its buffer overflows (which occurs much
too often), this module p
www.eeworm.com/read/119864/6081533
readme
This is a fast malloc implementation that I wrote several years ago.
I later used it as the basis of GNU malloc. My version differs from
the GNU version in that it does not support debugging hooks, a
www.eeworm.com/read/119864/6081558
c qsort.c
/* +++Date last modified: 05-Jul-1997 */
/*
** ssort() -- Fast, small, qsort()-compatible Shell sort
**
** by Ray Gardner, public domain 5/90
*/
/*
* Manuel Novoa III Dec 2000
*
* Th
www.eeworm.com/read/117227/6104921
java keywordmap.java
/*
* KeywordMap.java - Fast keyword->id map
* Copyright (C) 1998, 1999 Slava Pestov
* Copyright (C) 1999 Mike Dillon
*
* This program is free software; you can redistribute it and/or
* modify it
www.eeworm.com/read/100480/6269131
java keywordmap.java
/*
* KeywordMap.java - Fast keyword->id map
* Copyright (C) 1998, 1999 Slava Pestov
* Copyright (C) 1999 Mike Dillon
*
* This program is free software; you can redistribute it and/or
* modify it
www.eeworm.com/read/310703/6306506
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/494289/6381441
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/494289/6381586
cpp ebrick.cpp
/*
* Test program to implement the Comb method for fast
* computation of e.G on the elliptic curve E(F_p) for fixed G and E,
* using precomputation.
* This idea can be used to substa
www.eeworm.com/read/494289/6381615
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