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
212
213
214
215
216
217
218
|
#include <stdlib.h>
#include <Standard_Integer.hxx>
#include <Standard_ConstructionError.hxx>
#include <Standard_RangeError.hxx>
#ifndef _Standard_Stream_HeaderFile
#include <Standard_Stream.hxx>
#endif
#ifndef _Standard_OStream_HeaderFile
#include <Standard_OStream.hxx>
#endif
// ------------------------------------------------------------------
// CharToInt : Converts a character in an integer value
// ------------------------------------------------------------------
Handle_Standard_Type& Standard_Integer_Type_()
{
static Handle_Standard_Type _aType = new
Standard_Type("Standard_Integer",sizeof(Standard_Integer),0,NULL);
return _aType;
}
Standard_Integer CharToInt(const Standard_Character me)
{
if (!IsDigit(me)) {
Standard_ConstructionError::Raise();
}
Standard_Character S[2];
S[0] = me;
S[1] = 0;
return atoi(S);
}
// ------------------------------------------------------------------
// CharToInt : Converts a string in an integer value
// ------------------------------------------------------------------
Standard_Integer CharToInt(const Standard_CString me)
{
const Standard_Size Len = strlen(me);
for (Standard_Size I = 0; I < Len; I++)
if (!IsDigit(me[I])) {
Standard_ConstructionError::Raise();
}
return atoi(me);
}
// ------------------------------------------------------------------
// ShallowCopy : Copy of an integer
// ------------------------------------------------------------------
Standard_Integer ShallowCopy (const Standard_Integer me)
{ return me; }
// ------------------------------------------------------------------
// ShallowDump : Writes an integer value
// ------------------------------------------------------------------
Standard_EXPORT void ShallowDump (const Standard_Integer Value, Standard_OStream& s)
{ s << Value << " Standard_Integer" << "\n"; }
// ------------------------------------------------------------------
// NextPrime : Compute the first prime number greater or equal than an integer
// ------------------------------------------------------------------
#define VALUESNBR 4
long NextPrime (const long me )
{
struct svalue {int signiaib ;
int nbr ;} ;
struct svalue values[VALUESNBR] ;
long ia ;
long maxia ;
long ib[4] ;
int n[4] ;
// int signiaib[4] = { -1 , +1 , +1 , -1 } ;
int signiaib[4];
signiaib[0] = -1;
signiaib[1] = 1;
signiaib[2] = 1;
signiaib[3] = -1;
long remain ;
int nbvalues ;
int loop ;
int nindd ;
long minn ;
long maxvn ;
long premret = 0 ;
if (me < 0 || me >
#if defined (__alpha) || defined(DECOSF1)
127149130704178201
#else
2147483647
#endif
){
Standard_RangeError::
Raise("Try to apply NextPrime method with negative, null or too large value.");
}
if ( me <= 7 ) {
if ( me <= 1 )
return 1 ;
else if ( me <= 2 )
return 2 ;
else if ( me <= 3 )
return 3 ;
else if ( me <= 5 )
return 5 ;
else if ( me <= 7 )
return 7 ;
}
minn = ( me - 1 ) / 6 ; // n minimum
while ( 6*minn+1 < me ) {
minn += 1 ;
}
maxia = long( sqrt((double ) me ) / 6 + 1 ) ;
maxvn = minn + VALUESNBR ;
nbvalues = 0 ;
for ( nindd = 0 ; nindd < VALUESNBR ; nindd++ ) {
if ( 6*(nindd+minn)-1 < me ) {
values[nindd].nbr = 1 ;
values[nindd].signiaib = -1 ;
nbvalues += 1 ;
}
else {
values[nindd].nbr = 0 ;
values[nindd].signiaib = 0 ;
}
}
for ( ia = 1 ; ia <= maxia ; ia++ ) {
if ( nbvalues == VALUESNBR*2 ) {
break ;
}
remain = -VALUESNBR ;
ib[0] = ( minn + ia - remain ) / (6*ia - 1) ;
n[0] = int ( 6*ia*ib[0] - ia - ib[0] - minn ) ;
ib[1] = ( minn - ia - remain ) / (6*ia - 1) ;
n[1] = int ( 6*ia*ib[1] + ia - ib[1] - minn ) ;
ib[2] = ( minn + ia - remain ) / (6*ia + 1) ;
n[2] = int ( 6*ia*ib[2] - ia + ib[2] - minn ) ;
ib[3] = ( minn - ia - remain ) / (6*ia + 1) ;
n[3] = int ( 6*ia*ib[3] + ia + ib[3] - minn ) ;
for ( loop = 0 ; loop < 4 ; loop++ ) {
if ( n[loop] >= 0 && n[loop] < VALUESNBR ) {
if ( ( values[n[loop]].nbr == 0 ) ||
( values[n[loop]].signiaib == signiaib[loop] ) ) {
values[n[loop]].signiaib = -signiaib[loop] ;
values[n[loop]].nbr += 1 ;
if ( values[n[loop]].nbr <= 2 )
nbvalues += 1 ;
}
}
}
}
for ( nindd = 0 ; nindd < VALUESNBR ; nindd++ ) {
if ( values[nindd].nbr == 0 ) {
if ( me <= 6*(nindd+minn)-1 ) {
premret = 6*(nindd+minn)-1 ;
break ;
}
else if ( me <= 6*(nindd+minn)+1 ) {
premret = 6*(nindd+minn)+1 ;
break ;
}
}
else if ( values[nindd].nbr == 1 ) {
if ( values[nindd].signiaib > 0 ) {
if ( me <= 6*(nindd+minn)-1 ) {
premret = 6*(nindd+minn)-1 ;
break ;
}
}
else {
if ( me <= 6*(nindd+minn)+1 ) {
premret = 6*(nindd+minn)+1 ;
break ;
}
}
}
}
if ( premret != 0 ) {
return premret ;
}
return NextPrime ( 6*(maxvn-1)+2) ;
}
static const Standard_Integer Primes[] = {
101, 1009, 2003, 3001, 4001, 5003, 6007, 7001, 8009, 9001,
10007, 12007, 14009, 16007, 18013,
20011, 23003, 26003, 29009,
33013, 37003,
41011, 46021,
51001, 57037,
65003,
100019}; // catch the biggest
const Standard_Integer NbPrimes = 26; // does not include the biggest
Standard_Integer NextPrimeForMap(const Standard_Integer N)
{
Standard_Integer i;
for (i = 0; i < NbPrimes; i++)
if (Primes[i] > N) break;
return Primes[i];
}
|
