-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMultiPoly.cpp
More file actions
211 lines (172 loc) · 8.28 KB
/
MultiPoly.cpp
File metadata and controls
211 lines (172 loc) · 8.28 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
#include "MultPoly.h"
namespace MPQS {
bool SieveIndex::IsDivisible(std::uint32_t pri, std::uint32_t ind) const {
return !((ind_1 + ind) % pri && (ind_2 + ind) % pri);
}
void SieveIndex::InitialSet(int temp, int q, int myMin,
int myMax, int pri, int vecMaxSize) {
ind_1 = (temp) ? ((myMin > q) ? myMin - q : pri + myMin - q) : temp;
ind_2 = (temp) ? ((myMax > q) ? myMax - q : pri + myMax - q) :
(q == myMin) ? (myMax - myMin) : pri - (myMax - myMin);
int next_ind_1 = ((ind_1 - vecMaxSize) % pri) + pri;
offset = (next_ind_1 > ind_1) ? next_ind_1 - ind_1 :
pri - ind_1 + next_ind_1;
}
void SieveIndex::SmallSieve(std::vector<logType> &myLogs, int vecMaxSize,
int pri, logType LnFB) {
for (int j = ind_1; j < vecMaxSize; j += pri)
myLogs[j] += LnFB;
for (int j = ind_2; j < vecMaxSize; j += pri)
myLogs[j] += LnFB;
ind_1 = (ind_1 + offset >= pri) ? ind_1 + offset - pri : ind_1 + offset;
ind_2 = (ind_2 + offset >= pri) ? ind_2 + offset - pri : ind_2 + offset;
}
void SieveIndex::LargeSieve(std::vector<logType> &myLogs,
int vecMaxSize, int pri, logType LnFB) {
if (ind_1 < vecMaxSize) {
myLogs[ind_1] += LnFB;
ind_1 += (pri - vecMaxSize);
} else {
ind_1 -= vecMaxSize;
}
if (ind_2 < vecMaxSize) {
myLogs[ind_2] += LnFB;
ind_2 += (pri - vecMaxSize);
} else {
ind_2 -= vecMaxSize;
}
}
void SieveListsInit(const std::vector<int> &facBase,
const std::vector<logType> &LnFB,
const std::vector<std::size_t> &SieveDist,
std::vector<logType> &myLogs,
std::vector<SieveIndex> &myStart,
const mpz_class &firstSqrDiff, const mpz_class &VarA,
const mpz_class &VarB, std::size_t strt,
int LowBound, int vecMaxSize) {
mpz_class Temp;
for (std::size_t i = strt, facSize = facBase.size();
i < facSize; ++i) {
auto&& pri = facBase[i];
Temp = VarA % pri;
const int AUtil = int_invert(Temp.get_ui(), pri);
mpz_ui_sub(Temp.get_mpz_t(), SieveDist[i], VarB.get_mpz_t());
Temp *= AUtil;
mpz_mod_ui(Temp.get_mpz_t(), Temp.get_mpz_t(), pri);
int myMin = Temp.get_si();
mpz_ui_sub(Temp.get_mpz_t(), pri - SieveDist[i], VarB.get_mpz_t());
Temp *= AUtil;
mpz_mod_ui(Temp.get_mpz_t(), Temp.get_mpz_t(), pri);
B8D4
int myMax = Temp.get_si();
const int q = (LowBound % pri) + pri;
mpz_mod_ui(Temp.get_mpz_t(), firstSqrDiff.get_mpz_t(), pri);
if (myMin > myMax) {std::swap(myMin, myMax);}
myStart[i].InitialSet(Temp.get_si(), q, myMin,
myMax, pri, vecMaxSize);
if (pri < vecMaxSize) {
myStart[i].SmallSieve(myLogs, vecMaxSize, pri, LnFB[i]);
} else {
myStart[i].LargeSieve(myLogs, vecMaxSize, pri, LnFB[i]);
}
}
}
void SinglePoly(const std::vector<std::size_t> &SieveDist,
const std::vector<int> &facBase,
const std::vector<logType> &LnFB, vec2dint &powsOfSmooths,
vec2dint &powsOfPartials, std::vector<SieveIndex> &myStart,
hash64vec &partFactorsMap, hash64mpz &partIntvlMap,
std::vector<mpz_class> &smoothInterval,
std::vector<uint64_t> &largeCoFactors,
std::vector<mpz_class> &partialInterval,
const mpz_class &NextPrime, const mpz_class &myNum,
int LowBound, logType theCut, int TwiceLenB, int mpzFacSize,
int vecMaxSize, std::size_t strt, std::size_t vecMaxStrt) {
mpz_class VarA, VarB, VarC, IntVal;
TonelliShanksC(myNum, NextPrime, VarC);
IntVal = VarC * 2u;
mpz_invert(IntVal.get_mpz_t(),
IntVal.get_mpz_t(),
NextPrime.get_mpz_t());
VarA = NextPrime * NextPrime;
VarB = (IntVal * (myNum - VarC * VarC) + VarC) % VarA;
VarC = (VarB * VarB - myNum) / VarA;
IntVal = LowBound * (VarA * LowBound) + VarB * 2 * LowBound + VarC;
std::vector<logType> myLogs(vecMaxSize);
SieveListsInit(facBase, LnFB, SieveDist, myLogs ,myStart,
IntVal, VarA, VarB, strt, LowBound, vecMaxSize);
for (int chunk = 0; chunk < TwiceLenB; chunk += vecMaxSize) {
std::vector<int> largeLogs;
for (int i = 0; i < vecMaxSize; ++i)
if (myLogs[i] > theCut)
largeLogs.push_back(i + chunk);
for (const auto lrgLog: largeLogs) {
std::vector<int> primeIndexVec = {mpzFacSize, mpzFacSize};
const int myIntVal = LowBound + lrgLog;
IntVal = (VarA * myIntVal) * myIntVal +
(VarB * myIntVal) * 2 + VarC;
// If Negative, we push zero (i.e. the index referring to -1)
if (sgn(IntVal) < 0) {
IntVal = abs(IntVal);
primeIndexVec.push_back(0);
}
for (std::size_t j = 0; j < strt; ++j) {
while (mpz_divisible_ui_p(IntVal.get_mpz_t(),
facBase[j])) {
IntVal /= facBase[j];
primeIndexVec.push_back(j + 1);
}
}
for (std::uint32_t j = strt, facSize = facBase.size(),
ind = vecMaxSize - (lrgLog - chunk); j < facSize; ++j) {
if (myStart[j].IsDivisible(facBase[j], ind)) {
do {
IntVal /= facBase[j];
primeIndexVec.push_back(j + 1);
} while (mpz_divisible_ui_p(IntVal.get_mpz_t(),
facBase[j]));
}
}
if (cmp(IntVal, 1u) == 0) {
// Found a smooth number
smoothInterval.push_back(VarA * myIntVal + VarB);
powsOfSmooths.push_back(primeIndexVec);
} else if (cmp(IntVal, Significand53) < 0) {
const uint64_t myKey = static_cast<uint64_t>(
IntVal.get_d()
);
auto&& pFacIt = partFactorsMap.find(myKey);
if (pFacIt != partFactorsMap.end()) {
largeCoFactors.push_back(myKey);
primeIndexVec.insert(primeIndexVec.begin(),
pFacIt->second.cbegin(),
pFacIt->second.cend());
powsOfPartials.push_back(primeIndexVec);
auto&& intervalIt = partIntvlMap.find(myKey);
partialInterval.push_back((VarA * myIntVal + VarB) *
intervalIt->second);
partFactorsMap.erase(pFacIt);
partIntvlMap.erase(intervalIt);
} else {
partFactorsMap[myKey] = primeIndexVec;
partIntvlMap[myKey] = VarA * myIntVal + VarB;
}
}
}
if (chunk + vecMaxSize < TwiceLenB) {
std::fill(myLogs.begin(), myLogs.end(),
static_cast<logType>(0));
for (std::size_t i = strt; i < vecMaxStrt; ++i) {
myStart[i].SmallSieve(
myLogs, vecMaxSize, facBase[i], LnFB[i]
);
}
for (std::size_t i = vecMaxStrt, facSize = facBase.size();
i < facSize; ++i) {
myStart[i].LargeSieve(
myLogs, vecMaxSize, facBase[i], LnFB[i]
);
}
}
}
}
}