代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/133523/14037686
3 aflibaudiosampleratecvt.3
.TH "aflibAudioSampleRateCvt" 3 "8 May 2002" "Open Source Audio Library Project" \" -*- nroff -*-
.ad l
.nh
.SH NAME
aflibAudioSampleRateCvt \- Allows the \fBaflibConverter\fP class to be used in an a
www.eeworm.com/read/235612/14060178
m theo_mult_w.m
function [pm,p]=theo_mult_w(rin,fpress)
% [pm,p]=theo_mult_w(r)
%
% THEO_MULT_W computes the multiple contamination in a 1-D p-wave
% theogram according to the algorithm in
% Waters, "Reflection Sei
www.eeworm.com/read/235187/14082465
m chistart.m
function Chi2 = chistart (D,L,a,ncands,factor)
%CHISTART: Computes the initial size of the search ellipsoid
%
% This routine computes or approximates the initial size of the
% search ellipsoid. If
www.eeworm.com/read/205223/15323293
m cp0702_gaussian_derivatives_peak_frequency.m
%
% FUNCTION 7.5 : "cp0702_Gaussian_derivatives_peak
% frequency"
%
% Analysis of peak frequency of the first 15 derivatives of
% the Gaussian pulse as a function of the shape factor
%
% 'smp'
www.eeworm.com/read/108818/15574914
c cclocal_zoom.c
/*----------------------------- MegaWave Module -----------------------------*/
/* mwcommand
name = {cclocal_zoom};
version = {"1.2"};
author = {"Jacques Froment"};
function = {"In-place local
www.eeworm.com/read/100612/15868893
cpp williams.cpp
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/100612/15868900
c williams.c
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/100612/15868959
c pollard.c
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has itself
* only small factors.
* See "Speeding the Pollard and Elliptic Cu
www.eeworm.com/read/100612/15869040
cpp pollard.cpp
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/390970/8431052
cpp jdinput.cpp
/*
* jdinput.c
*
* Copyright (C) 1991-1995, Thomas G. Lane.
* This file is part of the Independent JPEG Group's software.
* For conditions of distribution and use, see the accompanying READM