代码搜索：efficient
找到约 1,594 项符合「efficient」的源代码
代码结果 1,594
www.eeworm.com/read/152843/5660077
s getuser.s
/*
* __get_user functions.
*
* (C) Copyright 1998 Linus Torvalds
* (C) Copyright 2005 Andi Kleen
*
* These functions have a non-standard call interface
* to make them more efficient, especially
www.eeworm.com/read/152843/5660190
s putuser.s
/*
* __put_user functions.
*
* (C) Copyright 1998 Linus Torvalds
* (C) Copyright 2001 Hirokazu Takata
*
* These functions have a non-standard call interface
* to make them more efficient.
*/
www.eeworm.com/read/370313/9605980
readme
SparseLib++ v. 1.6: Numerical Sparse Matrix Classes in C++
SparseLib++ is a C++ class library for efficient sparse matrix computations
across various computational platforms. The software
www.eeworm.com/read/270032/11050868
c fastjitter.c
/*
* Efficient Generation of Sampling Jitter Using Look-up Tables
* by Joseph M. Cychosz
* from "Graphics Gems", Academic Press, 1990
*/
/* Jitter.c - Sampling jitter generation routines.
www.eeworm.com/read/413528/11152215
h conncomp.h
//
// ConnComp.h
// Pipeline stage finds the connected components in a binary (0,*) image.
// Any non-zero value is treated as a pixel that should be labeled.
// An efficient UNION-FIND algo
www.eeworm.com/read/236141/14030898
txt readme.txt
Paradigm C++ Real-Time Kernel
=============================
RTKernel is a Paradigm C++ option that allows you to add real-time components
to your application is a fast and efficient way. Tasks, se
www.eeworm.com/read/205036/15328810
m innerprod.m
function res = innerprod(X,Y)
%INNERPROD Efficient inner product with a tensor.
%
% R = INNERPROD(X,Y) efficiently computes the inner product between
% two tensors X and Y. If Y is a tensor, then
www.eeworm.com/read/112777/15477085
c inftree9.c
/* inftree9.c -- generate Huffman trees for efficient decoding
* Copyright (C) 1995-2003 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
#include "zutil
www.eeworm.com/read/105622/15663702
pas lexopt.pas
{
DFA optimization algorithm.
This is an efficient (O(n log(n)) DFA optimization procedure based on the
algorithm given in Aho/Sethi/Ullman, 1986, Section 3.9.
Copyright (c) 1990-92 A
www.eeworm.com/read/390970/8430994
cpp inftrees.cpp
#include "stdafx.h"
/* inftrees.c -- generate Huffman trees for efficient decoding
* Copyright (C) 1995-1996 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h