代码搜索：factor
找到约 6,651 项符合「factor」的源代码
代码结果 6,651
www.eeworm.com/read/131113/5948273
java ac.java
package net.sf.dz.device.actuator;
import org.freehold.jukebox.conf.Configurable;
import net.sf.dz.event.ACListener;
/**
* The A/C unit abstraction.
*
*
*
* This abstraction describes any
www.eeworm.com/read/123301/6061779
y multinst.y
%{
/************************************************************
multinst.y
This example demonstates how to generate multiple instances
of parsers and lexical analysers. You will need to build
th
www.eeworm.com/read/122492/6065769
java primefactors.java
package numbercruncher.mathutils;
import java.util.*;
/**
* Compute the Sieve of Eratosthenes and prime factors.
*/
public class PrimeFactors {
/**
* Compute the Sieve of Eratosthene
www.eeworm.com/read/122492/6065858
java~1~ primefactors.java~1~
package numbercruncher.mathutils;
import java.util.Vector;
import java.util.Enumeration;
/**
* Compute the Sieve of Eratosthenes and prime factors.
*/
public class PrimeFactors
{
/**
* Co
www.eeworm.com/read/105599/6197743
properties message.properties
parser.parse.1=Wrong character.
parser.parse.2=Invalid reference number.
parser.next.1=A character is required after \\.
parser.next.2='?' is not expected. '(?:' or '(?=' or '(?!' or '(?
www.eeworm.com/read/101082/6244662
8 tunefs.8
.\" SCCSID: @(#)tunefs.8 8.1 9/11/90
.TH tunefs 8
.SH Name
tunefs \- tune up an existing file system
.SH Syntax
.B /etc/tunefs
[
.I options
]
.SH Description
.NXR "tunefs command"
.NXR "file system" "
www.eeworm.com/read/101082/6246525
8 tunefs.8
.\" SCCSID: @(#)tunefs.8 8.1 9/11/90
.TH tunefs 8
.SH Name
tunefs \- tune up an existing file system
.SH Syntax
.B /etc/tunefs
[
.I options
]
.SH Description
.NXR "tunefs command"
.NXR "file system" "
www.eeworm.com/read/494289/6381502
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/494289/6381518
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/494289/6381638
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