qs

type FactorBase interface {
	// Prepare factor base.<p>
	// @param m BigInteger - number to be factorized
	Init(m *math.Int) bool

	// Get number of primes in the factor base.<P>
	// @return int - number of primes in factor base
	GetNumPrimes() int

	// Get the i.th primes in the factor base.<p>
	// @param i int - prime index
	// @return BigInteger - prime value
	GetPrime(i int) *math.Int

	// Solve the equation x^2 = m (mod p)
	// @param i
	// @return
	GetSqrt(i int) *math.Int
}

type FactorBaseImpl struct {
	// contains filtered or unexported fields
}

type Function interface {

	// Instanciate function (and compute/initialize helpers).<p>
	// @param n BigInteger - number to be decomposed
	Init(n *math.Int) bool

	F(x *math.Int) *math.Int

	SqrArg(x *math.Int) *math.Int

	ModP(a, p *math.Int) *math.Int
}

type FunctionImpl struct {
	// contains filtered or unexported fields
}

type Relation struct {
	Rel_maxBits int
	// contains filtered or unexported fields
}

type Siever interface {
	Init(f Function, fb FactorBase, size int) bool

	SieveInterval(x0 *math.Int, solver Solver) *math.Int
}

type SieverImpl struct {
	// contains filtered or unexported fields
}

type Solver interface {
	Init(n *math.Int, f Function, fb FactorBase) bool

	Process(x *math.Int) int

	Done() bool

	Optimize()

	GetSolution() *math.Int
}

type SolverImpl struct {
	Relation
	// contains filtered or unexported fields
}