author | Claus Gittinger <cg@exept.de> |
Sat, 22 Mar 1997 16:19:44 +0100 | |
changeset 2484 | 05bd2cc43192 |
parent 2471 | 035dbf8db9f3 |
child 2495 | 0e6c781fd370 |
permissions | -rw-r--r-- |
1 | 1 |
" |
68 | 2 |
COPYRIGHT (c) 1994 by Claus Gittinger |
345 | 3 |
All Rights Reserved |
1 | 4 |
|
5 |
This software is furnished under a license and may be used |
|
6 |
only in accordance with the terms of that license and with the |
|
7 |
inclusion of the above copyright notice. This software may not |
|
8 |
be provided or otherwise made available to, or used by, any |
|
9 |
other person. No title to or ownership of the software is |
|
10 |
hereby transferred. |
|
11 |
" |
|
12 |
||
13 |
Integer subclass:#LargeInteger |
|
1210 | 14 |
instanceVariableNames:'sign digitByteArray' |
15 |
classVariableNames:'' |
|
16 |
poolDictionaries:'' |
|
17 |
category:'Magnitude-Numbers' |
|
1 | 18 |
! |
19 |
||
1794 | 20 |
!LargeInteger class methodsFor:'documentation'! |
1 | 21 |
|
88 | 22 |
copyright |
23 |
" |
|
24 |
COPYRIGHT (c) 1994 by Claus Gittinger |
|
345 | 25 |
All Rights Reserved |
88 | 26 |
|
27 |
This software is furnished under a license and may be used |
|
28 |
only in accordance with the terms of that license and with the |
|
29 |
inclusion of the above copyright notice. This software may not |
|
30 |
be provided or otherwise made available to, or used by, any |
|
31 |
other person. No title to or ownership of the software is |
|
32 |
hereby transferred. |
|
33 |
" |
|
34 |
! |
|
35 |
||
77 | 36 |
documentation |
37 |
" |
|
38 |
This class provides arbitrary precision integers. These are represented as: |
|
39 |
sign (-1/0/+1) and, if sign ~~ 0 |
|
40 |
a ByteArray of digits with 8 bits per element; |
|
88 | 41 |
least significant 8 bits at index 1 ... |
1 | 42 |
|
88 | 43 |
The implementation is definitely not tuned for high performance |
44 |
(some key-methods should be rewritten as primitives), |
|
77 | 45 |
but ok for now, since LargeIntegers are not used very often. |
46 |
It will be reimplemented when everything else runs fine and a need arises |
|
47 |
(or someone rewrites it and sends me the code :-). |
|
48 |
||
49 |
For real speed, its implementation should be mapped onto a tuned arbitrary |
|
88 | 50 |
precision math package (maybe even special-cased for 32 and 64 bit |
51 |
large-ints, since those are the most common). |
|
52 |
||
53 |
LargeIntegers are usually not created explicitely, but result from |
|
54 |
SmallInteger arithmetic overflowing the SmallInteger range. |
|
357 | 55 |
Also, results of LargeInteger operations are converted to back to |
56 |
SmallIntegers, when possible (see normalize). |
|
92 | 57 |
|
58 |
In contrast to ST-80, there is only one class for LargeIntegers, keeping |
|
59 |
the sign as an instance variable (ST-80 has LargePositiveInteger and |
|
60 |
LargeNegativeInteger). This may change. |
|
1295 | 61 |
|
62 |
[author:] |
|
2001 | 63 |
Claus Gittinger |
1556 | 64 |
|
65 |
[see also:] |
|
2001 | 66 |
Number |
67 |
Float Fraction FixedPoint |
|
68 |
SmallInteger |
|
77 | 69 |
" |
70 |
! ! |
|
1 | 71 |
|
1794 | 72 |
!LargeInteger class methodsFor:'instance creation'! |
1 | 73 |
|
74 |
new |
|
75 |
"catch creation message" |
|
76 |
||
77 |
self error:'LargeIntegers cannot be created with new' |
|
78 |
! |
|
79 |
||
701 | 80 |
new:numberOfDigits |
81 |
"catch creation message" |
|
2 | 82 |
|
701 | 83 |
self error:'LargeIntegers cannot be created with new' |
1 | 84 |
! |
85 |
||
701 | 86 |
value:aSmallInteger |
87 |
"create and return a new LargeInteger with value taken from |
|
88 |
the argument, aSmallInteger. |
|
89 |
Notice: this should be only used internally, since such small |
|
90 |
largeIntegers do not normally occur in the system. |
|
91 |
May change without notice." |
|
92 |
||
93 |
^ self basicNew value:aSmallInteger |
|
94 |
||
95 |
"LargeInteger value:3689" |
|
96 |
! ! |
|
97 |
||
1794 | 98 |
!LargeInteger class methodsFor:'queries'! |
701 | 99 |
|
100 |
isBuiltInClass |
|
1264 | 101 |
"return true if this class is known by the run-time-system. |
102 |
Here, true is returned." |
|
701 | 103 |
|
104 |
^ true |
|
1264 | 105 |
|
106 |
"Modified: 23.4.1996 / 15:59:21 / cg" |
|
1 | 107 |
! ! |
108 |
||
68 | 109 |
!LargeInteger methodsFor:'arithmetic'! |
1 | 110 |
|
701 | 111 |
* aNumber |
112 |
"return the product of the receiver and the argument, aNumber" |
|
113 |
||
114 |
|otherSign| |
|
115 |
||
116 |
(sign == 0) ifTrue:[^ 0]. "cannot happen if correctly normalized" |
|
117 |
||
118 |
" |
|
119 |
this is the common case, multiplying with SmallInteger. |
|
120 |
Use a special method for this case ... |
|
121 |
" |
|
122 |
(aNumber class == SmallInteger) ifTrue:[ |
|
123 |
^ self productFromInteger:aNumber |
|
124 |
]. |
|
125 |
||
126 |
" |
|
127 |
if the argument is not a largeInteger, coerce |
|
128 |
" |
|
129 |
(aNumber class == self class) ifFalse:[ |
|
130 |
^ self retry:#* coercing:aNumber |
|
131 |
]. |
|
132 |
||
133 |
otherSign := aNumber sign. |
|
134 |
(sign == otherSign) ifTrue:[^ self absMul:aNumber]. |
|
135 |
(otherSign == 0) ifTrue:[^ 0]. |
|
136 |
^ (self absMul:aNumber) sign:-1 |
|
137 |
! |
|
138 |
||
92 | 139 |
+ aNumber |
140 |
"return the sum of the receiver and the argument, aNumber" |
|
141 |
||
142 |
|otherSign| |
|
143 |
||
144 |
(sign == 0) ifTrue:[^ aNumber]. "cannot happen if correctly normalized" |
|
145 |
||
146 |
" |
|
147 |
this is the common case, adding a SmallInteger. |
|
148 |
Use a special method for this case ... |
|
149 |
" |
|
150 |
(aNumber class == SmallInteger) ifTrue:[ |
|
345 | 151 |
^ self sumFromInteger:aNumber |
92 | 152 |
]. |
153 |
||
154 |
" |
|
155 |
if the argument is not a largeInteger, coerce |
|
156 |
" |
|
157 |
(aNumber class == self class) ifFalse:[ |
|
345 | 158 |
^ self retry:#+ coercing:aNumber |
92 | 159 |
]. |
160 |
||
161 |
otherSign := aNumber sign. |
|
162 |
(sign > 0) ifTrue:[ |
|
345 | 163 |
"I am positive" |
164 |
(otherSign > 0) ifTrue:[^ self absPlus:aNumber]. |
|
165 |
(otherSign < 0) ifTrue:[^ self absMinus:aNumber]. |
|
166 |
^ self |
|
92 | 167 |
]. |
168 |
"I am negative" |
|
169 |
(otherSign > 0) ifTrue:[^ aNumber absMinus:self]. |
|
170 |
(otherSign < 0) ifTrue:[^ (self absPlus:aNumber) sign:-1]. |
|
171 |
^ self |
|
357 | 172 |
|
173 |
" |
|
174 |
SmallInteger maxVal |
|
175 |
SmallInteger maxVal + 1 |
|
176 |
SmallInteger maxVal + 2 |
|
177 |
SmallInteger minVal |
|
178 |
SmallInteger minVal - 1 |
|
179 |
" |
|
92 | 180 |
! |
181 |
||
182 |
- aNumber |
|
183 |
"return the difference of the receiver and the argument, aNumber" |
|
184 |
||
1794 | 185 |
|otherSign| |
92 | 186 |
|
187 |
(sign == 0) ifTrue:[^ aNumber negated]. "cannot happen if correctly normalized" |
|
188 |
||
189 |
" |
|
190 |
this is the common case, subtracting a SmallInteger. |
|
191 |
Use a special method for this case ... |
|
192 |
" |
|
193 |
(aNumber class == SmallInteger) ifTrue:[ |
|
2001 | 194 |
sign < 0 ifTrue:[ |
195 |
aNumber > 0 ifTrue:[ |
|
196 |
^ (self absFastPlus:aNumber) sign:-1 |
|
197 |
]. |
|
198 |
^ (self absFastMinus:aNumber) sign:-1 |
|
199 |
]. |
|
200 |
aNumber > 0 ifTrue:[ |
|
201 |
^ self absFastMinus:aNumber |
|
202 |
]. |
|
203 |
^ self absFastPlus:aNumber |
|
92 | 204 |
]. |
205 |
||
206 |
" |
|
207 |
if the argument is not a largeInteger, coerce |
|
208 |
" |
|
209 |
(aNumber class == self class) ifFalse:[ |
|
2001 | 210 |
^ self retry:#- coercing:aNumber |
92 | 211 |
]. |
212 |
||
213 |
otherSign := aNumber sign. |
|
214 |
(sign > 0) ifTrue:[ |
|
2001 | 215 |
"I am positive" |
216 |
(otherSign > 0) ifTrue:[^ self absMinus:aNumber]. |
|
217 |
(otherSign < 0) ifTrue:[^ self absPlus:aNumber]. |
|
218 |
^ self |
|
92 | 219 |
]. |
220 |
"I am negative" |
|
221 |
(otherSign > 0) ifTrue:[^ (self absPlus:aNumber) negated]. |
|
222 |
(otherSign < 0) ifTrue:[^ (self absMinus:aNumber) negated]. |
|
223 |
^ self |
|
224 |
||
225 |
" |
|
226 |
12345678901234567890 - 0 |
|
357 | 227 |
12345678901234567890 - 1 |
92 | 228 |
12345678901234567890 - -1 |
229 |
-12345678901234567890 - 1 |
|
230 |
-12345678901234567890 - -1 |
|
231 |
||
232 |
12345678901234567890 - 12345678901234567880 |
|
233 |
12345678901234567890 - 12345000000000000000 |
|
234 |
12345678901234567890 - -87654321098765432110 |
|
235 |
-12345678901234567890 - 87654321098765432110 |
|
236 |
-12345678901234567890 - -12345678901234567880 |
|
237 |
-12345678901234567890 - -12345678901234567980 |
|
238 |
" |
|
1794 | 239 |
|
240 |
"Modified: 20.10.1996 / 18:42:16 / cg" |
|
92 | 241 |
! |
242 |
||
701 | 243 |
/ aNumber |
1065 | 244 |
"return the quotient of the receiver and the argument, aNumber" |
92 | 245 |
|
701 | 246 |
aNumber isInteger ifTrue:[ |
247 |
^ (Fraction numerator:self |
|
248 |
denominator:aNumber) reduced |
|
92 | 249 |
]. |
250 |
||
701 | 251 |
"this is a q&d hack - we loose lots of precision here ..." |
252 |
^ (self asFloat / aNumber asFloat) |
|
92 | 253 |
! |
254 |
||
68 | 255 |
// aNumber |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
256 |
"return the quotient of the receiver and the argument, aNumber. |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
257 |
The result is truncated toward negative infinity and negative, |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
258 |
if the operands signs differ." |
1 | 259 |
|
1890 | 260 |
|otherSign divMod d quo abs "{ Class: SmallInteger }" n| |
1 | 261 |
|
262 |
otherSign := aNumber sign. |
|
263 |
||
92 | 264 |
" |
265 |
this is the common case, dividing by a SmallInteger. |
|
266 |
Use a special method for this case ... |
|
267 |
" |
|
68 | 268 |
(aNumber class == SmallInteger) ifTrue:[ |
2001 | 269 |
abs := aNumber. |
270 |
abs := abs abs. |
|
271 |
(abs between:1 and:16r003fffff) ifTrue:[ |
|
272 |
divMod := self absFastDiv:abs. |
|
273 |
quo := divMod at:1. |
|
274 |
(sign == otherSign) ifTrue:[^ quo]. |
|
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
275 |
|
2001 | 276 |
"/ stupid adjust ... |
277 |
(divMod at:2) == 0 ifFalse:[ |
|
278 |
^ (quo sign:-1) - 1 |
|
279 |
]. |
|
280 |
^ quo sign:-1 |
|
281 |
]. |
|
282 |
n := aNumber asLargeInteger. |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
283 |
] ifFalse:[ |
2001 | 284 |
n := aNumber |
1 | 285 |
]. |
68 | 286 |
|
92 | 287 |
" |
288 |
if the argument is not a largeInteger, coerce |
|
289 |
" |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
290 |
(n class == self class) ifFalse:[ |
2001 | 291 |
^ self retry:#// coercing:aNumber |
1 | 292 |
]. |
293 |
||
1890 | 294 |
divMod := self absDiv:n. |
295 |
||
296 |
(sign == otherSign) ifTrue:[^ divMod at:1]. |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
297 |
|
1890 | 298 |
"/ stupid adjust for truncation ... |
299 |
quo := divMod at:1. |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
300 |
(divMod at:2) == 0 ifFalse:[ |
2001 | 301 |
^ (quo sign:-1) - 1 |
1 | 302 |
]. |
1890 | 303 |
^ quo sign:-1 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
304 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
305 |
" |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
306 |
900 // 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
307 |
-900 // 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
308 |
900 // -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
309 |
-900 // -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
310 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
311 |
9000000000 // 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
312 |
-9000000000 // 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
313 |
9000000000 // -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
314 |
-9000000000 // -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
315 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
316 |
900 quo: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
317 |
-900 quo: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
318 |
900 quo: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
319 |
-900 quo: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
320 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
321 |
9000000000 quo: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
322 |
-9000000000 quo: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
323 |
9000000000 quo: -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
324 |
-9000000000 quo: -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
325 |
" |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
326 |
|
1890 | 327 |
"Modified: 5.11.1996 / 16:39:36 / cg" |
68 | 328 |
! |
329 |
||
330 |
\\ aNumber |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
331 |
"return the remainder of division of the receiver by the argument, aNumber. |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
332 |
The sign of the result is that of aNumber." |
68 | 333 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
334 |
|abs rem| |
68 | 335 |
|
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
336 |
abs := aNumber abs. |
92 | 337 |
|
338 |
" |
|
339 |
this is the common case, dividing by a SmallInteger. |
|
340 |
Use a special method for this case ... |
|
341 |
" |
|
68 | 342 |
(aNumber class == SmallInteger) ifTrue:[ |
2001 | 343 |
(abs between:1 and:16r003fffff) ifTrue:[ |
344 |
rem := (self absFastDiv:abs) at:2. |
|
345 |
] ifFalse:[ |
|
346 |
rem := (self absDiv:abs asLargeInteger) at:2 |
|
347 |
]. |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
348 |
] ifFalse:[ |
2001 | 349 |
" |
350 |
if the argument is not a largeInteger, coerce |
|
351 |
" |
|
352 |
(aNumber class == self class) ifFalse:[ |
|
353 |
^ self retry:#\\ coercing:aNumber |
|
354 |
]. |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
355 |
|
2001 | 356 |
rem := (self absDiv:abs) at:2. |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
357 |
]. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
358 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
359 |
aNumber negative ifTrue:[ |
2001 | 360 |
^ rem sign:-1 |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
361 |
]. |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
362 |
^ rem |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
363 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
364 |
" |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
365 |
900 \\ 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
366 |
-900 \\ 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
367 |
900 \\ -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
368 |
-900 \\ -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
369 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
370 |
9000000000 \\ 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
371 |
-9000000000 \\ 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
372 |
9000000000 \\ -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
373 |
-9000000000 \\ -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
374 |
|
1890 | 375 |
9000000000 \\ 7 |
376 |
-9000000000 \\ 7 |
|
377 |
9000000000 \\ -7 |
|
378 |
-9000000000 \\ -7 |
|
379 |
||
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
380 |
900 rem: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
381 |
-900 rem: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
382 |
900 rem: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
383 |
-900 rem: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
384 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
385 |
9000000000 rem: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
386 |
-9000000000 rem: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
387 |
9000000000 rem: -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
388 |
-9000000000 rem: -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
389 |
" |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
390 |
|
1890 | 391 |
"Modified: 5.11.1996 / 17:10:10 / cg" |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
392 |
! |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
393 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
394 |
divMod:aNumber |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
395 |
"return an array filled with self // aNumber and |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
396 |
self \\ aNumber. |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
397 |
The result is only defined for positive receiver and |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
398 |
argument." |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
399 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
400 |
|otherSign divMod d rem abs "{ Class: SmallInteger }" | |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
401 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
402 |
" |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
403 |
this is the common case, dividing by a SmallInteger. |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
404 |
Use a special method for this case ... |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
405 |
" |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
406 |
(aNumber class == SmallInteger) ifTrue:[ |
2001 | 407 |
^ self absFastDiv:aNumber abs. |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
408 |
]. |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
409 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
410 |
" |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
411 |
if the argument is not a largeInteger, coerce |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
412 |
" |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
413 |
(aNumber class == self class) ifTrue:[ |
2001 | 414 |
^ self absDiv:aNumber abs |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
415 |
]. |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
416 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
417 |
^ super divMod:aNumber |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
418 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
419 |
" |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
420 |
9000000000 // 4000000000 => 2 |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
421 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
422 |
9000000000 \\ 4000000000 => 1000000000 |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
423 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
424 |
9000000000 divMod: 4000000000 => #(2 1000000000) |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
425 |
" |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
426 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
427 |
"Modified: 29.10.1996 / 20:44:23 / cg" |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
428 |
"Created: 29.10.1996 / 21:22:05 / cg" |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
429 |
! |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
430 |
|
1210 | 431 |
negated |
432 |
"return an integer with value negated from the receivers value." |
|
433 |
||
434 |
|newNumber| |
|
435 |
||
436 |
(sign == 0) ifTrue:[^ 0]. |
|
437 |
||
438 |
" |
|
439 |
special case for SmallInteger minVal |
|
440 |
" |
|
441 |
sign == 1 ifTrue:[ |
|
442 |
digitByteArray size == 4 ifTrue:[ |
|
443 |
(digitByteArray at:1) == 0 ifTrue:[ |
|
444 |
(digitByteArray at:2) == 0 ifTrue:[ |
|
445 |
(digitByteArray at:3) == 0 ifTrue:[ |
|
446 |
(digitByteArray at:4) == 16r40 ifTrue:[ |
|
447 |
^ SmallInteger minVal |
|
448 |
]. |
|
449 |
] |
|
450 |
] |
|
451 |
] |
|
452 |
] |
|
453 |
]. |
|
454 |
newNumber := self shallowCopy. |
|
455 |
newNumber sign:(sign negated). |
|
456 |
^ newNumber |
|
457 |
! |
|
458 |
||
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
459 |
quo:aNumber |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
460 |
"return the quotient of the receiver and the argument, aNumber. |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
461 |
The result is truncated toward zero (which is different from //, which |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
462 |
truncates toward negative infinity). |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
463 |
The results sign is negative if the receiver has a sign |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
464 |
different from the args sign" |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
465 |
|
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
466 |
|otherSign d quo abs "{ Class: SmallInteger }" | |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
467 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
468 |
otherSign := aNumber sign. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
469 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
470 |
" |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
471 |
this is the common case, dividing by a SmallInteger. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
472 |
Use a special method for this case ... |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
473 |
" |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
474 |
(aNumber class == SmallInteger) ifTrue:[ |
2001 | 475 |
abs := aNumber. |
476 |
abs := abs abs. |
|
477 |
(abs between:1 and:16r003fffff) ifTrue:[ |
|
478 |
quo := (self absFastDiv:abs) at:1. |
|
479 |
(sign == otherSign) ifTrue:[^ quo]. |
|
480 |
^ quo sign:-1 |
|
481 |
] |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
482 |
]. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
483 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
484 |
" |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
485 |
if the argument is not a largeInteger, coerce |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
486 |
" |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
487 |
(aNumber class == self class) ifFalse:[ |
2001 | 488 |
^ self retry:#quo: coercing:aNumber |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
489 |
]. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
490 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
491 |
sign < 0 ifTrue:[ |
2001 | 492 |
(sign == otherSign) ifTrue:[^ (self absDiv:aNumber negated) at:1]. |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
493 |
] ifFalse:[ |
2001 | 494 |
(sign == otherSign) ifTrue:[^ (self absDiv:aNumber) at:1]. |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
495 |
]. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
496 |
^ ((self absDiv:aNumber) at:1) sign:-1 |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
497 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
498 |
" |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
499 |
900 // 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
500 |
-900 // 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
501 |
900 // -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
502 |
-900 // -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
503 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
504 |
9000000000 // 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
505 |
-9000000000 // 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
506 |
9000000000 // -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
507 |
-9000000000 // -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
508 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
509 |
900 quo: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
510 |
-900 quo: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
511 |
900 quo: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
512 |
-900 quo: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
513 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
514 |
9000000000 quo: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
515 |
-9000000000 quo: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
516 |
9000000000 quo: -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
517 |
-9000000000 quo: -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
518 |
" |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
519 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
520 |
"Modified: 5.11.1996 / 14:14:17 / cg" |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
521 |
! |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
522 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
523 |
rem:aNumber |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
524 |
"return the remainder of division of the receiver by the argument, aNumber. |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
525 |
The returned remainder has the same sign as the receiver." |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
526 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
527 |
|rem abs "{ Class: SmallInteger }" | |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
528 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
529 |
" |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
530 |
this is the common case, dividing by a SmallInteger. |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
531 |
Use special code for this case ... |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
532 |
" |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
533 |
(aNumber class == SmallInteger) ifTrue:[ |
2001 | 534 |
abs := aNumber. |
535 |
abs := abs abs. |
|
536 |
(abs between:1 and:16r003fffff) ifTrue:[ |
|
537 |
rem := (self absFastDiv:abs) at:2. |
|
538 |
] ifFalse:[ |
|
539 |
rem := (self absDiv:(abs asLargeInteger)) at:2 |
|
540 |
]. |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
541 |
] ifFalse:[ |
2001 | 542 |
" |
543 |
if the argument is not a largeInteger, coerce |
|
544 |
" |
|
545 |
(aNumber class == self class) ifFalse:[ |
|
546 |
^ self retry:#\\ coercing:aNumber |
|
547 |
]. |
|
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
548 |
|
2001 | 549 |
rem := (self absDiv:aNumber) at:2 |
1 | 550 |
]. |
92 | 551 |
|
552 |
sign < 0 ifTrue:[ |
|
2001 | 553 |
^ rem sign:-1 |
1 | 554 |
]. |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
555 |
^ rem |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
556 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
557 |
" |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
558 |
900 \\ 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
559 |
-900 \\ 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
560 |
900 \\ -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
561 |
-900 \\ -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
562 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
563 |
9000000000 \\ 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
564 |
-9000000000 \\ 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
565 |
9000000000 \\ -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
566 |
-9000000000 \\ -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
567 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
568 |
900 rem: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
569 |
-900 rem: 400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
570 |
900 rem: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
571 |
-900 rem: -400 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
572 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
573 |
9000000000 rem: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
574 |
-9000000000 rem: 4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
575 |
9000000000 rem: -4000000000 |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
576 |
-9000000000 rem: -4000000000 |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
577 |
" |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
578 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
579 |
"Modified: 5.11.1996 / 14:02:59 / cg" |
1 | 580 |
! ! |
581 |
||
701 | 582 |
!LargeInteger methodsFor:'byte access'! |
583 |
||
584 |
digitAt:index |
|
585 |
"return 8 bits of value, starting at byte index" |
|
586 |
||
587 |
index > digitByteArray size ifTrue:[^ 0]. |
|
588 |
^ digitByteArray at:index |
|
589 |
! |
|
590 |
||
591 |
digitAt:index put:aByte |
|
592 |
"set the 8 bits, index is a byte index" |
|
593 |
||
594 |
digitByteArray at:index put:aByte |
|
595 |
! |
|
596 |
||
597 |
digitLength |
|
598 |
"return the number bytes used by this Integer" |
|
599 |
||
600 |
" |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
601 |
check if there is a 0-byte ... |
701 | 602 |
this allows to ask unnormalized LargeIntegers |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
603 |
for their digitLength |
701 | 604 |
" |
605 |
|l "{ Class: SmallInteger }" | |
|
92 | 606 |
|
701 | 607 |
l := digitByteArray size. |
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
608 |
[l ~~ 0 and:[(digitByteArray at:l) == 0]] whileTrue:[ |
701 | 609 |
l := l - 1. |
610 |
]. |
|
611 |
^ l |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
612 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
613 |
"Modified: 2.2.1996 / 16:47:21 / cg" |
701 | 614 |
! |
615 |
||
616 |
digits |
|
617 |
"return a byteArray fille with the receivers bits |
|
618 |
(8 bits of the absolute value per element)" |
|
619 |
||
620 |
^ digitByteArray |
|
621 |
! ! |
|
622 |
||
623 |
!LargeInteger methodsFor:'coercing & converting'! |
|
68 | 624 |
|
701 | 625 |
asFloat |
626 |
"return a Float with same value as myself. |
|
627 |
Since floats have a limited precision, you usually loose bits when |
|
628 |
doing this." |
|
629 |
||
630 |
|newFloat| |
|
631 |
||
632 |
newFloat := 0.0. |
|
633 |
(sign == 0) ifFalse:[ |
|
634 |
digitByteArray reverseDo:[:aDigit | |
|
635 |
newFloat := (newFloat * 256.0) + aDigit asFloat |
|
636 |
]. |
|
637 |
(sign < 0) ifTrue:[ |
|
638 |
newFloat := newFloat negated |
|
345 | 639 |
] |
701 | 640 |
]. |
641 |
^ newFloat |
|
642 |
||
643 |
" |
|
644 |
1234567890 asFloat |
|
645 |
12345678901234567890 asFloat |
|
646 |
12345678901234567890 asFloat asInteger |
|
647 |
" |
|
648 |
! |
|
649 |
||
650 |
asLargeInteger |
|
651 |
"return a LargeInteger with same value as myself - thats me" |
|
652 |
||
653 |
^ self |
|
654 |
! |
|
655 |
||
656 |
asSmallInteger |
|
657 |
"return a SmallInteger with same value as myself - |
|
658 |
the result is invalid if the receivers value cannot |
|
659 |
be represented as a SmallInteger. |
|
660 |
Q: should we raise an exception if this happens ?" |
|
661 |
||
662 |
|value| |
|
663 |
||
664 |
value := 0. |
|
665 |
(sign == 0) ifFalse:[ |
|
666 |
digitByteArray reverseDo:[:aDigit | |
|
667 |
value := (value times:256) + aDigit |
|
345 | 668 |
]. |
701 | 669 |
(sign < 0) ifTrue:[ |
670 |
value := value negated |
|
345 | 671 |
] |
68 | 672 |
]. |
701 | 673 |
^ value |
674 |
! |
|
675 |
||
676 |
coerce:aNumber |
|
677 |
"return the argument as a LargeInteger" |
|
678 |
||
679 |
^ aNumber asLargeInteger |
|
680 |
! |
|
681 |
||
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
682 |
compressed |
701 | 683 |
"if the receiver can be represented as a SmallInteger, return |
2267 | 684 |
a SmallInteger with my value; |
685 |
otherwise remove leading zero bytes in the digitByte array |
|
686 |
and return the receiver" |
|
701 | 687 |
|
688 |
|index "{ Class: SmallInteger }" |
|
2267 | 689 |
val "{ Class: SmallInteger }" |
690 |
index0 |
|
691 |
| |
|
701 | 692 |
|
693 |
%{ /* NOCONTEXT */ |
|
694 |
OBJ t; |
|
695 |
||
1133 | 696 |
if (__INST(sign) == __MKSMALLINT(0)) { |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
697 |
RETURN (__MKSMALLINT(0)); |
701 | 698 |
} |
699 |
||
1133 | 700 |
t = __INST(digitByteArray); |
701 | 701 |
if (__isByteArray(t)) { |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
702 |
unsigned char *_digitBytes = __ByteArrayInstPtr(t)->ba_element; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
703 |
int _idx, _idx0; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
704 |
int _val; |
701 | 705 |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
706 |
_idx = _idx0 = _byteArraySize(t); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
707 |
while ((_idx > 0) && (_digitBytes[_idx - 1] == 0)) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
708 |
_idx--; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
709 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
710 |
if (_idx <= 4) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
711 |
if (_idx <= 2) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
712 |
if (_idx == 0) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
713 |
RETURN (__MKSMALLINT(0)); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
714 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
715 |
if (_idx == 1) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
716 |
_val = _digitBytes[0]; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
717 |
if (__INST(sign) == __MKSMALLINT(-1)) |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
718 |
_val = -_val; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
719 |
RETURN (__MKSMALLINT(_val)); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
720 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
721 |
_val = (_digitBytes[1]<<8) + _digitBytes[0]; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
722 |
if (__INST(sign) == __MKSMALLINT(-1)) |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
723 |
_val = -_val; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
724 |
RETURN (__MKSMALLINT(_val)); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
725 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
726 |
if (_idx == 3) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
727 |
_val = (((_digitBytes[2]<<8) + _digitBytes[1])<<8) + _digitBytes[0]; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
728 |
if (__INST(sign) == __MKSMALLINT(-1)) |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
729 |
_val = -_val; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
730 |
RETURN (__MKSMALLINT(_val)); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
731 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
732 |
_val = _digitBytes[3]; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
733 |
if (_val <= 0x40) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
734 |
_val = (((((_val<<8) + _digitBytes[2])<<8) + _digitBytes[1])<<8) + _digitBytes[0]; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
735 |
if (__INST(sign) == __MKSMALLINT(-1)) |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
736 |
_val = -_val; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
737 |
if ((_val >= _MIN_INT) && (_val <= _MAX_INT)) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
738 |
RETURN (__MKSMALLINT(_val)); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
739 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
740 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
741 |
} |
701 | 742 |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
743 |
if (_idx == _idx0) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
744 |
RETURN (self); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
745 |
} |
2267 | 746 |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
747 |
/* |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
748 |
* must copy & cut off some bytes |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
749 |
*/ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
750 |
{ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
751 |
OBJ newDigits; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
752 |
OBJ oldDigits; |
701 | 753 |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
754 |
/* |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
755 |
* careful - there is no context here to protect |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
756 |
* the receiver ... |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
757 |
*/ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
758 |
__PROTECT__(self); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
759 |
__PROTECT__(__INST(digitByteArray)); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
760 |
newDigits = __BYTEARRAY_UNINITIALIZED_NEW_INT(_idx); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
761 |
__UNPROTECT__(oldDigits); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
762 |
__UNPROTECT__(self); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
763 |
if (newDigits) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
764 |
bcopy(__ByteArrayInstPtr(oldDigits)->ba_element, |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
765 |
__ByteArrayInstPtr(newDigits)->ba_element, |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
766 |
_idx); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
767 |
__INST(digitByteArray) = newDigits; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
768 |
__STORE(self, newDigits); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
769 |
RETURN (self); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
770 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
771 |
/* |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
772 |
* allocation failed ... |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
773 |
* ... fall through to trigger the error |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
774 |
*/ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
775 |
} |
701 | 776 |
} |
777 |
%}. |
|
2267 | 778 |
index0 := index := digitByteArray size. |
701 | 779 |
[(index > 0) and:[(digitByteArray at:index) == 0]] whileTrue:[ |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
780 |
index := index - 1 |
701 | 781 |
]. |
782 |
||
2267 | 783 |
(index ~~ index0) ifTrue:[ |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
784 |
digitByteArray := digitByteArray copyFrom:1 to:index |
701 | 785 |
]. |
786 |
^ self |
|
787 |
! |
|
788 |
||
789 |
value:aSmallInteger |
|
790 |
"return a new LargeInteger with value taken from a SmallInteger. |
|
791 |
This method will fail, if the argument is not a smallInteger." |
|
792 |
||
793 |
|absValue |
|
794 |
b1 "{ Class: SmallInteger }" |
|
795 |
b2 "{ Class: SmallInteger }" |
|
796 |
b3 "{ Class: SmallInteger }"| |
|
92 | 797 |
|
798 |
" |
|
701 | 799 |
could have simply created a 4-byte largeinteger and normalize |
800 |
it; the code below does the normalize right away, avoiding the |
|
801 |
overhead of producing any intermediate byte-arrays (and the scanning) |
|
92 | 802 |
" |
701 | 803 |
(aSmallInteger == 0) ifTrue: [ |
2001 | 804 |
digitByteArray := ByteArray with:0. |
805 |
sign := 0. |
|
806 |
^ self |
|
701 | 807 |
]. |
808 |
(aSmallInteger < 0) ifTrue: [ |
|
2001 | 809 |
sign := -1. |
810 |
absValue := aSmallInteger negated |
|
701 | 811 |
] ifFalse: [ |
2001 | 812 |
sign := 1. |
813 |
absValue := aSmallInteger |
|
701 | 814 |
]. |
815 |
b1 := absValue bitAnd:16rFF. |
|
816 |
absValue := absValue bitShift:-8. |
|
817 |
absValue == 0 ifTrue:[ |
|
2001 | 818 |
digitByteArray := ByteArray with:b1 |
701 | 819 |
] ifFalse:[ |
2001 | 820 |
b2 := absValue bitAnd:16rFF. |
821 |
absValue := absValue bitShift:-8. |
|
822 |
absValue == 0 ifTrue:[ |
|
823 |
digitByteArray := ByteArray with:b1 with:b2 |
|
824 |
] ifFalse:[ |
|
825 |
b3 := absValue bitAnd:16rFF. |
|
826 |
absValue := absValue bitShift:-8. |
|
827 |
absValue == 0 ifTrue:[ |
|
828 |
digitByteArray := ByteArray with:b1 with:b2 with:b3 |
|
829 |
] ifFalse:[ |
|
830 |
digitByteArray := ByteArray with:b1 with:b2 with:b3 with:absValue |
|
831 |
] |
|
832 |
] |
|
701 | 833 |
] |
1890 | 834 |
|
835 |
"Modified: 5.11.1996 / 16:15:39 / cg" |
|
701 | 836 |
! ! |
837 |
||
838 |
!LargeInteger methodsFor:'comparing'! |
|
839 |
||
840 |
< aNumber |
|
841 |
"return true, if the argument, aNumber is greater than the receiver" |
|
842 |
||
843 |
|otherSign| |
|
844 |
||
845 |
(aNumber class == self class) ifFalse:[ |
|
846 |
^ self retry:#< coercing:aNumber |
|
847 |
]. |
|
848 |
otherSign := aNumber sign. |
|
849 |
||
850 |
(sign > 0) ifTrue:[ |
|
851 |
"I am positive" |
|
852 |
(otherSign > 0) ifTrue:[^ self absLess:aNumber]. |
|
853 |
^ false "aNumber is <= 0" |
|
854 |
]. |
|
855 |
(sign == 0) ifTrue:[ |
|
856 |
(otherSign > 0) ifTrue:[^ true]. |
|
857 |
^ false |
|
858 |
]. |
|
859 |
"I am negative" |
|
860 |
(otherSign > 0) ifTrue:[^ true]. |
|
861 |
(otherSign == 0) ifTrue:[^ true]. |
|
862 |
^ (self absLess:aNumber) not |
|
92 | 863 |
! |
864 |
||
701 | 865 |
= aNumber |
866 |
"return true, if the argument, aNumber has the same value as |
|
867 |
the receiver" |
|
868 |
||
869 |
(aNumber class == self class) ifFalse:[ |
|
870 |
aNumber respondsToArithmetic ifFalse:[ ^ false ]. |
|
871 |
^ self retry:#= coercing:aNumber |
|
872 |
]. |
|
873 |
(aNumber sign == sign) ifFalse:[^ false]. |
|
874 |
^ self absEq:aNumber |
|
875 |
! |
|
876 |
||
877 |
> aNumber |
|
878 |
"return true, if the argument, aNumber is less than the receiver" |
|
879 |
||
880 |
|otherSign| |
|
881 |
||
882 |
(aNumber class == self class) ifFalse:[ |
|
883 |
^ self retry:#> coercing:aNumber |
|
884 |
]. |
|
885 |
otherSign := aNumber sign. |
|
886 |
||
887 |
(sign > 0) ifTrue:[ |
|
888 |
"I am positive" |
|
889 |
(otherSign > 0) ifTrue:[^ aNumber absLess:self]. |
|
890 |
^ true "aNumber is <= 0" |
|
891 |
]. |
|
892 |
(sign == 0) ifTrue:[ |
|
893 |
"I am zero" |
|
894 |
(otherSign > 0) ifTrue:[^ false]. |
|
895 |
^ true |
|
896 |
]. |
|
897 |
"I am negative" |
|
898 |
(otherSign > 0) ifTrue:[^ false]. |
|
899 |
(otherSign == 0) ifTrue:[^ false]. |
|
900 |
^ (self absLess:aNumber) not |
|
901 |
! ! |
|
902 |
||
903 |
!LargeInteger methodsFor:'double dispatching'! |
|
904 |
||
92 | 905 |
differenceFromInteger:anInteger |
906 |
"sent, when anInteger does not know how to subtract the receiver. |
|
907 |
Return the result of 'anInteger - self'. The argument must be a SmallInteger." |
|
908 |
||
909 |
anInteger > 0 ifTrue:[ |
|
2001 | 910 |
sign > 0 ifTrue:[ |
911 |
^ (self absFastMinus:anInteger) sign:-1 |
|
912 |
]. |
|
913 |
^ self absFastPlus:anInteger |
|
92 | 914 |
]. |
1794 | 915 |
anInteger == 0 ifTrue:[ |
2001 | 916 |
^ self negated |
1794 | 917 |
]. |
918 |
sign > 0 ifTrue:[ |
|
2001 | 919 |
^ (self absFastPlus:anInteger negated) sign:-1 |
1794 | 920 |
]. |
921 |
^ (self absFastMinus:anInteger) sign:-1 |
|
92 | 922 |
|
923 |
" |
|
924 |
12345678901234567890 |
|
925 |
-12345678901234567890 |
|
926 |
12345678901234567890 differenceFromInteger:0 |
|
927 |
12345678901234567890 differenceFromInteger:1 |
|
928 |
12345678901234567890 differenceFromInteger:-1 |
|
929 |
-12345678901234567890 differenceFromInteger:1 |
|
930 |
-12345678901234567890 differenceFromInteger:-1 |
|
931 |
" |
|
1794 | 932 |
|
933 |
"Modified: 20.10.1996 / 18:41:54 / cg" |
|
68 | 934 |
! |
935 |
||
936 |
productFromInteger:anInteger |
|
937 |
"sent, when anInteger does not know how to multiply the receiver. |
|
938 |
Return the product of the receiver and the argument, aSmallInteger" |
|
939 |
||
940 |
|num result |
|
941 |
resultDigitByteArray |
|
942 |
val "{ Class: SmallInteger }" |
|
943 |
len "{ Class: SmallInteger }" |
|
944 |
carry "{ Class: SmallInteger }" |
|
85 | 945 |
prod "{ Class: SmallInteger }" |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
946 |
ok lResult| |
68 | 947 |
|
948 |
"multiplying by a small integer is done here" |
|
949 |
||
950 |
"trivial cases" |
|
951 |
anInteger == 0 ifTrue:[^ 0]. |
|
952 |
anInteger == 1 ifTrue:[^ self]. |
|
953 |
||
954 |
num := anInteger abs. |
|
955 |
(num > 16r3FFFFF) ifTrue:[ |
|
2001 | 956 |
"if num is too big (so that multiplying by a byte could create a Large)" |
68 | 957 |
|
2001 | 958 |
^ anInteger retry:#* coercing:self |
68 | 959 |
]. |
960 |
||
961 |
len := digitByteArray size. |
|
962 |
||
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
963 |
val := num. |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
964 |
val < 16r100 ifTrue:[ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
965 |
lResult := len + 1. |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
966 |
] ifFalse:[ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
967 |
val < 16r10000 ifTrue:[ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
968 |
lResult := len + 2 |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
969 |
] ifFalse:[ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
970 |
lResult := len + 4. |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
971 |
] |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
972 |
]. |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
973 |
result := self class basicNew numberOfDigits:lResult. |
1 | 974 |
|
68 | 975 |
anInteger < 0 ifTrue:[ |
2001 | 976 |
sign > 0 ifTrue:[ |
977 |
result sign:-1 |
|
978 |
]. |
|
68 | 979 |
] ifFalse:[ |
2001 | 980 |
sign < 0 ifTrue:[ |
981 |
result sign:sign |
|
982 |
] |
|
68 | 983 |
]. |
984 |
||
985 |
resultDigitByteArray := result digits. |
|
986 |
||
987 |
carry := 0. |
|
988 |
||
85 | 989 |
ok := false. |
990 |
%{ |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
991 |
OBJ __digitByteArray = __INST(digitByteArray); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
992 |
|
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
993 |
if (__isSmallInteger(len) |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
994 |
&& __isByteArray(__digitByteArray) |
85 | 995 |
&& __isByteArray(resultDigitByteArray)) { |
2001 | 996 |
int _l = __intVal(len); |
997 |
int _v = __intVal(val); |
|
998 |
unsigned _carry = 0; |
|
999 |
unsigned _prod; |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1000 |
unsigned char *digitP = __ByteArrayInstPtr(__digitByteArray)->ba_element; |
2001 | 1001 |
unsigned char *resultP = __ByteArrayInstPtr(resultDigitByteArray)->ba_element; |
1797
8dafe47b33fd
faster multiplication by an integer.
Claus Gittinger <cg@exept.de>
parents:
1794
diff
changeset
|
1002 |
|
8dafe47b33fd
faster multiplication by an integer.
Claus Gittinger <cg@exept.de>
parents:
1794
diff
changeset
|
1003 |
#if defined(i386) /* XXX actually: LSB_FIRST */ |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1004 |
# if defined (__GNUC__) |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1005 |
/* |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1006 |
* can do it long-word-wise; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1007 |
* 32*32 -> 64 multiplication |
2001 | 1008 |
*/ |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1009 |
while (_l > 3) { |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1010 |
unsigned __pHi, __pLow; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1011 |
|
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1012 |
/* |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1013 |
* max: 0xFFFF.FFFF * 0xFFFF.FFFF -> 0xFFFF.FFFE.0000.0001 |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1014 |
* + maxCarry (0xFFFF.FFFF) -> 0xFFFF.FFFF.0000.0000 |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1015 |
*/ |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1016 |
asm ("mull %3 \n |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1017 |
addl %4,%%eax \n |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1018 |
adcl $0,%%edx" |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1019 |
: "=a" ((unsigned long)(__pLow)), |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1020 |
"=d" ((unsigned long)(__pHi)) |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1021 |
: "0" ((unsigned long)(((unsigned long *)digitP)[0])), |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1022 |
"1" ((unsigned long)(_v)), |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1023 |
"rm" ((unsigned long)(_carry)) ); |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1024 |
|
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1025 |
((unsigned long *)resultP)[0] = __pLow; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1026 |
_carry = __pHi; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1027 |
digitP += 4; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1028 |
resultP += 4; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1029 |
_l -= 4; |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1030 |
} |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1031 |
# else |
85 | 1032 |
|
2001 | 1033 |
if (_v <= 0xFFFF) { |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1034 |
/* can do it short-wise |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1035 |
* |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1036 |
* max: 0xFFFF * 0xFFFF -> 0xFFFE.0001 |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1037 |
* + maxCarry (0xFFFF) -> 0xFFFF.0000 |
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1038 |
*/ |
2001 | 1039 |
while (_l > 1) { |
1040 |
_prod = ((unsigned short *)digitP)[0] * _v + _carry; |
|
1041 |
((unsigned short *)resultP)[0] = _prod & 0xFFFF; |
|
1042 |
_carry = _prod >> 16; |
|
1043 |
digitP += 2; |
|
1044 |
resultP += 2; |
|
1045 |
_l -= 2; |
|
1046 |
} |
|
1047 |
} |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1048 |
# endif |
1797
8dafe47b33fd
faster multiplication by an integer.
Claus Gittinger <cg@exept.de>
parents:
1794
diff
changeset
|
1049 |
#endif |
2001 | 1050 |
{ |
1051 |
while (_l-- > 0) { |
|
1052 |
_prod = *digitP++ * _v + _carry; |
|
1053 |
*resultP++ = _prod & 0xFF; |
|
1054 |
_carry = _prod >> 8; |
|
1055 |
} |
|
1797
8dafe47b33fd
faster multiplication by an integer.
Claus Gittinger <cg@exept.de>
parents:
1794
diff
changeset
|
1056 |
|
2001 | 1057 |
while (_carry) { |
1058 |
*resultP++ = _carry & 0xFF; |
|
1059 |
_carry >>= 8; |
|
1060 |
} |
|
1061 |
} |
|
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1062 |
|
2001 | 1063 |
ok = true; |
85 | 1064 |
} |
1065 |
%}. |
|
92 | 1066 |
" |
1067 |
fall back - normally not reached |
|
1068 |
(could make it a primitive-failure as well) |
|
1069 |
" |
|
85 | 1070 |
ok ifFalse:[ |
2001 | 1071 |
1 to:len do:[:i | |
1072 |
prod := (digitByteArray basicAt:i) * val + carry. |
|
1073 |
resultDigitByteArray basicAt:i put:(prod bitAnd:16rFF). |
|
1074 |
carry := prod bitShift:-8. |
|
1075 |
]. |
|
1076 |
[carry ~~ 0] whileTrue:[ |
|
1077 |
len := len + 1. |
|
1078 |
resultDigitByteArray basicAt:len put:(carry bitAnd:16rFF). |
|
1079 |
carry := carry bitShift:-8 |
|
1080 |
]. |
|
68 | 1081 |
]. |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1082 |
^ result compressed |
92 | 1083 |
! |
1084 |
||
701 | 1085 |
sumFromInteger:anInteger |
1086 |
"sent, when anInteger does not know how to add the receiver. |
|
1087 |
Return the sum of the receiver and the argument, (which must be a SmallInteger)" |
|
92 | 1088 |
|
701 | 1089 |
anInteger > 0 ifTrue:[ |
2001 | 1090 |
sign < 0 ifTrue:[ |
1091 |
^ (self absFastMinus:anInteger) sign:-1 |
|
1092 |
]. |
|
1093 |
^ self absFastPlus:anInteger |
|
701 | 1094 |
]. |
1794 | 1095 |
anInteger == 0 ifTrue:[ |
2001 | 1096 |
^ self |
1794 | 1097 |
]. |
1098 |
sign < 0 ifTrue:[ |
|
2001 | 1099 |
^ (self absFastPlus:anInteger abs) sign:-1 |
1794 | 1100 |
]. |
1101 |
^ self absFastMinus:anInteger |
|
92 | 1102 |
|
701 | 1103 |
" |
1104 |
12345678901234567890 |
|
1105 |
-12345678901234567890 |
|
1106 |
12345678901234567890 sumFromInteger:0 |
|
1107 |
-12345678901234567890 sumFromInteger:0 |
|
1108 |
12345678901234567890 sumFromInteger:1 |
|
1109 |
12345678901234567890 sumFromInteger:-1 |
|
1110 |
-12345678901234567890 sumFromInteger:1 |
|
1111 |
-12345678901234567890 sumFromInteger:-1 |
|
1112 |
" |
|
1794 | 1113 |
|
1114 |
"Modified: 20.10.1996 / 18:41:51 / cg" |
|
68 | 1115 |
! ! |
1116 |
||
701 | 1117 |
!LargeInteger methodsFor:'printing & storing'! |
345 | 1118 |
|
701 | 1119 |
storeOn:aStream |
1120 |
"append a representation of the receiver to aStream, which can |
|
1121 |
be used to reconstruct the receiver." |
|
68 | 1122 |
|
701 | 1123 |
self printOn:aStream. |
1124 |
aStream nextPutAll:' asLargeInteger' |
|
68 | 1125 |
! ! |
1126 |
||
1127 |
!LargeInteger methodsFor:'private'! |
|
1128 |
||
701 | 1129 |
absDiv:anInteger |
1130 |
"return an array with two LargeIntegers representing |
|
1131 |
abs(self) // abs(theArgument) and abs(self) \\ abs(theArgument). |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1132 |
Used as a helper for \\, //, rem: and quo:. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1133 |
This method needs a rewrite." |
68 | 1134 |
|
701 | 1135 |
|tmp1 tmp2 |
1890 | 1136 |
quo |
701 | 1137 |
count "{ Class: SmallInteger }" |
1138 |
digit "{ Class: SmallInteger }" | |
|
92 | 1139 |
|
701 | 1140 |
anInteger == 0 ifTrue:[ |
2001 | 1141 |
^ DivisionByZeroSignal raise |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1142 |
]. |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1143 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1144 |
self = anInteger ifTrue:[ |
2001 | 1145 |
^ Array with:1 with:0 |
701 | 1146 |
]. |
92 | 1147 |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1148 |
tmp1 := self simpleDeepCopy. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1149 |
tmp1 sign:1. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1150 |
tmp2 := anInteger simpleDeepCopy. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1151 |
tmp2 sign:1. |
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1152 |
|
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1153 |
(tmp1 < tmp2) ifTrue:[ |
2001 | 1154 |
^ Array with:0 with:tmp1 |
68 | 1155 |
]. |
92 | 1156 |
|
701 | 1157 |
count := 0. |
1890 | 1158 |
[tmp2 absLess: tmp1] whileTrue:[ |
2001 | 1159 |
tmp2 mul2. |
1160 |
count := count + 1 |
|
701 | 1161 |
]. |
1162 |
||
1890 | 1163 |
tmp2 div2. |
701 | 1164 |
|
1890 | 1165 |
quo := 0 asLargeInteger. |
1166 |
quo sign:1. |
|
927
8d8edf9df0ae
fixed \\ vs. rem: and // vs. quo: stupidities;
Claus Gittinger <cg@exept.de>
parents:
701
diff
changeset
|
1167 |
|
701 | 1168 |
[count == 0] whileFalse:[ |
2001 | 1169 |
quo mul2. |
1170 |
(tmp1 absLess:tmp2) ifFalse:[ |
|
1171 |
quo digits at:1 put:((quo digits at:1) bitOr:1). |
|
1172 |
(tmp1 absSubtract: tmp2) ifFalse:[ |
|
1173 |
"/ difference is zero; continue shifting |
|
1174 |
count := count - 1. |
|
1175 |
[count >= 8] whileTrue:[ |
|
1176 |
quo mul256. |
|
1177 |
count := count - 8 |
|
1178 |
]. |
|
1179 |
[count == 0] whileFalse:[ |
|
1180 |
quo mul2. |
|
1181 |
count := count - 1. |
|
1182 |
]. |
|
1183 |
^ Array with:quo compressed with:tmp1 compressed |
|
1184 |
]. |
|
1185 |
]. |
|
1186 |
tmp2 div2. |
|
1187 |
count := count - 1 |
|
701 | 1188 |
]. |
1890 | 1189 |
^ Array with:quo compressed with:tmp1 compressed |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1190 |
|
1890 | 1191 |
"Modified: 5.11.1996 / 18:40:24 / cg" |
92 | 1192 |
! |
1193 |
||
701 | 1194 |
absEq:aLargeInteger |
1195 |
"return true, if abs(self) = abs(theArgument)" |
|
92 | 1196 |
|
701 | 1197 |
|len1 "{ Class: SmallInteger }" |
1198 |
len2 "{ Class: SmallInteger }" |
|
1199 |
d1 "{ Class: SmallInteger }" |
|
1200 |
d2 "{ Class: SmallInteger }" |
|
1201 |
otherDigitByteArray | |
|
92 | 1202 |
|
701 | 1203 |
len1 := digitByteArray size. |
1204 |
otherDigitByteArray := aLargeInteger digits. |
|
1205 |
len2 := otherDigitByteArray size. |
|
92 | 1206 |
|
701 | 1207 |
[(digitByteArray basicAt:len1) == 0] whileTrue:[ |
1208 |
len1 := len1 - 1 |
|
1209 |
]. |
|
1210 |
[(otherDigitByteArray basicAt:len2) == 0] whileTrue:[ |
|
1211 |
len2 := len2 - 1 |
|
68 | 1212 |
]. |
701 | 1213 |
(len1 ~~ len2) ifTrue:[^ false]. |
1214 |
[len1 > 0] whileTrue:[ |
|
1215 |
d1 := digitByteArray basicAt:len1. |
|
1216 |
d2 := otherDigitByteArray basicAt:len1. |
|
1217 |
(d1 ~~ d2) ifTrue:[^ false]. |
|
1218 |
len1 := len1 - 1 |
|
68 | 1219 |
]. |
701 | 1220 |
^ true |
68 | 1221 |
! |
1222 |
||
1890 | 1223 |
absFastDiv:aPositiveSmallInteger |
68 | 1224 |
"return an array with two LargeIntegers representing |
1890 | 1225 |
abs(self) // aPositiveSmallInteger and abs(self) \\ aPositiveSmallInteger" |
68 | 1226 |
|
77 | 1227 |
|tmp1 "{ Class: SmallInteger }" |
1228 |
prevRest "{ Class: SmallInteger }" |
|
1229 |
count "{ Class: SmallInteger }" |
|
85 | 1230 |
newDigitByteArray result |
1231 |
ok| |
|
68 | 1232 |
|
1890 | 1233 |
aPositiveSmallInteger == 0 ifTrue:[ |
2001 | 1234 |
^ DivisionByZeroSignal raise |
68 | 1235 |
]. |
1236 |
||
1237 |
"This cannot happen (if always normalized) |
|
1890 | 1238 |
self < aPositiveSmallInteger ifTrue:[ |
2001 | 1239 |
^ Array with:0 with:self |
68 | 1240 |
]. |
1241 |
" |
|
1242 |
count := digitByteArray size. |
|
1243 |
result := self class basicNew numberOfDigits:count. |
|
1244 |
newDigitByteArray := result digits. |
|
85 | 1245 |
ok := false. |
1246 |
%{ |
|
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1247 |
OBJ __digits; |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1248 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1249 |
__digits = __INST(digitByteArray); |
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1250 |
|
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1251 |
if (__isByteArray(__digits) |
85 | 1252 |
&& __isByteArray(newDigitByteArray) |
1890 | 1253 |
&& __bothSmallInteger(count, aPositiveSmallInteger)) { |
2001 | 1254 |
unsigned int rest = 0; |
1255 |
int index = __intVal(count); |
|
1256 |
int index0; |
|
1257 |
unsigned divisor = __intVal(aPositiveSmallInteger); |
|
1258 |
unsigned char *digitBytes = __ByteArrayInstPtr(__digits)->ba_element; |
|
1259 |
unsigned char *resultBytes = __ByteArrayInstPtr(newDigitByteArray)->ba_element; |
|
68 | 1260 |
|
2001 | 1261 |
index0 = index; |
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1262 |
|
1890 | 1263 |
/* |
2001 | 1264 |
if (divisor < 0xFFFF) { |
1265 |
while (index > 1) { |
|
1266 |
unsigned int t; |
|
1267 |
unsigned div; |
|
85 | 1268 |
|
2001 | 1269 |
index--; |
1270 |
t = digitBytes[index]; |
|
1271 |
index--; |
|
1272 |
t = (t << 8) | digitBytes[index]; |
|
1273 |
t = t | (rest << 16); |
|
1274 |
div = t / divisor; |
|
1275 |
rest = t % divisor; |
|
1276 |
resultBytes[index+1] = (div >> 8); |
|
1277 |
resultBytes[index] = (div & 0xFF); |
|
1278 |
} |
|
1279 |
} |
|
1890 | 1280 |
*/ |
2001 | 1281 |
while (index > 0) { |
1282 |
unsigned int t; |
|
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1283 |
|
2001 | 1284 |
index--; |
1285 |
t = digitBytes[index]; |
|
1286 |
t = t | (rest << 8); |
|
1287 |
resultBytes[index] = t / divisor; |
|
1288 |
rest = t % divisor; |
|
1289 |
} |
|
1290 |
prevRest = __MKSMALLINT(rest); |
|
1291 |
ok = true; |
|
1842
b28609c73839
added divMod: for faster largeNumber printString generation.
Claus Gittinger <cg@exept.de>
parents:
1797
diff
changeset
|
1292 |
|
2001 | 1293 |
/* |
1294 |
* no need to normalize ? |
|
1295 |
*/ |
|
1296 |
if ((index0 > 4) |
|
1297 |
&& (resultBytes[index0-1])) { |
|
1298 |
RETURN ( __ARRAY_WITH2(result, prevRest)); |
|
1299 |
} |
|
85 | 1300 |
} |
1301 |
%}. |
|
1302 |
" |
|
1303 |
slow code - not normally reached |
|
1304 |
(could also do a primitiveFailure here) |
|
1305 |
" |
|
92 | 1306 |
ok ifFalse:[ |
2001 | 1307 |
self primitiveFailed |
68 | 1308 |
]. |
1309 |
||
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1310 |
^ Array with:result compressed with:prevRest |
68 | 1311 |
! |
1312 |
||
701 | 1313 |
absFastMinus:aSmallInteger |
1314 |
"return a LargeInteger representing abs(self) - abs(theArgument). |
|
1315 |
The result is not normalized." |
|
1316 |
||
1794 | 1317 |
|result resultDigitByteArray lastDigit |
701 | 1318 |
len "{ Class: SmallInteger }" |
1319 |
index "{ Class: SmallInteger }" |
|
1320 |
borrow "{ Class: SmallInteger }" |
|
1321 |
diff "{ Class: SmallInteger }" | |
|
1322 |
||
1323 |
len := digitByteArray size. |
|
1324 |
||
1325 |
result := self class basicNew numberOfDigits:(len + 1). |
|
1326 |
resultDigitByteArray := result digits. |
|
1327 |
||
1328 |
index := 1. |
|
1329 |
borrow := aSmallInteger abs. |
|
1330 |
||
1331 |
[borrow ~~ 0] whileTrue:[ |
|
2001 | 1332 |
(index <= len) ifTrue:[ |
1333 |
diff := (digitByteArray basicAt:index) - (borrow bitAnd:16rFF). |
|
1334 |
borrow := borrow bitShift:-8. |
|
1335 |
diff < 0 ifTrue:[ |
|
1336 |
diff := diff + 256. |
|
1337 |
borrow := borrow + 1. |
|
1338 |
] |
|
1339 |
] ifFalse:[ |
|
1340 |
diff := borrow bitAnd:255. |
|
1341 |
borrow := borrow bitShift:-8. |
|
1342 |
]. |
|
1343 |
resultDigitByteArray basicAt:index put:(lastDigit := diff). |
|
1344 |
index := index + 1 |
|
701 | 1345 |
]. |
1346 |
[index <= len] whileTrue:[ |
|
2001 | 1347 |
resultDigitByteArray basicAt:index put:(lastDigit := digitByteArray basicAt:index). |
1348 |
index := index + 1 |
|
701 | 1349 |
]. |
1350 |
||
1794 | 1351 |
lastDigit == 0 ifTrue:[ |
2001 | 1352 |
^ result compressed |
1794 | 1353 |
]. |
701 | 1354 |
^ result |
1355 |
||
1356 |
" |
|
1357 |
12345678900000000000 absFastMinus:1 |
|
1358 |
12345678900000000000 absFastMinus:1000000 |
|
1359 |
12345678900000000000 absFastMinus:255 |
|
1360 |
(SmallInteger maxVal + 1) absFastMinus:1 |
|
1361 |
(SmallInteger minVal - 1) absFastMinus:1 |
|
1362 |
" |
|
1794 | 1363 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1364 |
"Modified: 5.11.1996 / 14:09:16 / cg" |
701 | 1365 |
! |
1366 |
||
1367 |
absFastPlus:aSmallInteger |
|
1368 |
"return a LargeInteger representing abs(self) + abs(theArgument). |
|
1369 |
The result is not normalized." |
|
1370 |
||
1794 | 1371 |
|result resultDigitByteArray lastDigit |
701 | 1372 |
len "{ Class: SmallInteger }" |
1373 |
index "{ Class: SmallInteger }" |
|
1374 |
carry "{ Class: SmallInteger }" | |
|
1375 |
||
1376 |
len := digitByteArray size. |
|
1377 |
||
1378 |
result := self class basicNew numberOfDigits:(len + 1). |
|
1379 |
resultDigitByteArray := result digits. |
|
1380 |
||
1381 |
index := 1. |
|
1382 |
carry := aSmallInteger abs. |
|
1383 |
||
1384 |
[carry ~~ 0] whileTrue:[ |
|
2001 | 1385 |
(index <= len) ifTrue:[ |
1386 |
carry := (digitByteArray basicAt:index) + carry. |
|
1387 |
]. |
|
1388 |
resultDigitByteArray basicAt:index put:(lastDigit := carry bitAnd:16rFF). |
|
1389 |
carry := carry bitShift:-8. |
|
1390 |
index := index + 1 |
|
701 | 1391 |
]. |
1392 |
[index <= len] whileTrue:[ |
|
2001 | 1393 |
resultDigitByteArray basicAt:index put:(lastDigit := digitByteArray basicAt:index). |
1394 |
index := index + 1 |
|
701 | 1395 |
]. |
1396 |
||
1794 | 1397 |
lastDigit == 0 ifTrue:[ |
2001 | 1398 |
^ result compressed |
1794 | 1399 |
]. |
701 | 1400 |
^ result |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1401 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1402 |
"Modified: 5.11.1996 / 14:09:19 / cg" |
701 | 1403 |
! |
1404 |
||
1405 |
absLess:aLargeInteger |
|
1890 | 1406 |
"return true, if abs(self) < abs(theArgument). |
1407 |
This handles unnormalized largeIntegers." |
|
701 | 1408 |
|
1890 | 1409 |
|myLen "{ Class: SmallInteger }" |
1410 |
otherLen "{ Class: SmallInteger }" |
|
701 | 1411 |
d1 "{ Class: SmallInteger }" |
1412 |
d2 "{ Class: SmallInteger }" |
|
1413 |
otherDigitByteArray | |
|
1414 |
||
1890 | 1415 |
myLen := digitByteArray size. |
701 | 1416 |
otherDigitByteArray := aLargeInteger digits. |
1890 | 1417 |
otherLen := otherDigitByteArray size. |
701 | 1418 |
|
1890 | 1419 |
[(digitByteArray basicAt:myLen) == 0] whileTrue:[ |
2001 | 1420 |
myLen := myLen - 1 |
701 | 1421 |
]. |
1890 | 1422 |
[(otherDigitByteArray basicAt:otherLen) == 0] whileTrue:[ |
2001 | 1423 |
otherLen := otherLen - 1 |
701 | 1424 |
]. |
1890 | 1425 |
(myLen < otherLen) ifTrue:[^ true]. |
1426 |
(myLen > otherLen) ifTrue:[^ false]. |
|
701 | 1427 |
|
1890 | 1428 |
[myLen > 0] whileTrue:[ |
2001 | 1429 |
d1 := digitByteArray basicAt:myLen. |
1430 |
d2 := otherDigitByteArray basicAt:myLen. |
|
1431 |
d1 == d2 ifFalse:[ |
|
1432 |
(d1 < d2) ifTrue:[^ true]. |
|
1433 |
^ false |
|
1434 |
]. |
|
1435 |
myLen := myLen - 1 |
|
701 | 1436 |
]. |
1437 |
^ false |
|
1890 | 1438 |
|
1439 |
"Modified: 5.11.1996 / 18:37:27 / cg" |
|
701 | 1440 |
! |
1441 |
||
1442 |
absMinus:aLargeInteger |
|
1443 |
"return a LargeInteger representing abs(self) - abs(theArgument)" |
|
1444 |
||
1445 |
|result done |
|
1446 |
otherDigitByteArray resultDigitByteArray |
|
1447 |
len1 "{ Class: SmallInteger }" |
|
1448 |
len2 "{ Class: SmallInteger }" |
|
1449 |
index "{ Class: SmallInteger }" |
|
1450 |
borrow "{ Class: SmallInteger }" |
|
1451 |
diff "{ Class: SmallInteger }" |
|
1408
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1452 |
carry "{ Class: SmallInteger }" |
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1453 |
lResult| |
701 | 1454 |
|
1455 |
len1 := digitByteArray size. |
|
1456 |
otherDigitByteArray := aLargeInteger digits. |
|
1457 |
len2 := otherDigitByteArray size. |
|
1458 |
||
1408
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1459 |
lResult := (len1 max: len2) + 1. |
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1460 |
result := self class basicNew numberOfDigits:lResult. |
701 | 1461 |
resultDigitByteArray := result digits. |
1462 |
||
1463 |
index := 1. |
|
1464 |
borrow := 0. |
|
1465 |
||
1466 |
done := false. |
|
1467 |
[done] whileFalse:[ |
|
2001 | 1468 |
diff := borrow. |
1469 |
(index <= len1) ifTrue:[ |
|
1470 |
diff := diff + (digitByteArray basicAt:index). |
|
1471 |
(index <= len2) ifTrue:[ |
|
1472 |
diff := diff - (otherDigitByteArray basicAt:index) |
|
1473 |
] |
|
1474 |
] ifFalse:[ |
|
1475 |
(index <= len2) ifTrue:[ |
|
1476 |
diff := diff - (otherDigitByteArray basicAt:index) |
|
1477 |
] ifFalse:[ |
|
1478 |
"end reached" |
|
1479 |
done := true |
|
1480 |
] |
|
1481 |
]. |
|
701 | 1482 |
|
2001 | 1483 |
"/ workaround for |
1484 |
"/ gcc code generator bug |
|
1408
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1485 |
|
2001 | 1486 |
(diff >= 0) ifTrue:[ |
1487 |
borrow := 0 |
|
1488 |
] ifFalse:[ |
|
1489 |
borrow := -1. |
|
1490 |
diff := diff + 16r100 |
|
1491 |
]. |
|
1408
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1492 |
|
701 | 1493 |
"/ (diff < 0) ifTrue:[ |
1494 |
"/ borrow := -1. |
|
1495 |
"/ diff := diff + 16r100 |
|
1496 |
"/ ] ifFalse:[ |
|
1497 |
"/ borrow := 0 |
|
1498 |
"/ ]. |
|
1408
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1499 |
|
2001 | 1500 |
resultDigitByteArray basicAt:index put:diff. |
1501 |
index := index + 1 |
|
701 | 1502 |
]. |
1408
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1503 |
|
701 | 1504 |
(borrow ~~ 0) ifTrue:[ |
2001 | 1505 |
"/ must generate 255's complement |
1504
9e5ae33dbfe1
oops - bug when subtracting with borrow:
Claus Gittinger <cg@exept.de>
parents:
1408
diff
changeset
|
1506 |
|
2001 | 1507 |
result sign:-1. |
1508 |
[index <= lResult] whileTrue:[ |
|
1509 |
resultDigitByteArray basicAt:index put:16rFF. |
|
1510 |
index := index + 1. |
|
1511 |
]. |
|
1512 |
index := resultDigitByteArray size. |
|
1513 |
[index > 0] whileTrue:[ |
|
1514 |
resultDigitByteArray basicAt:index put:(255 - (resultDigitByteArray at:index)). |
|
1515 |
index := index -1. |
|
1516 |
]. |
|
1504
9e5ae33dbfe1
oops - bug when subtracting with borrow:
Claus Gittinger <cg@exept.de>
parents:
1408
diff
changeset
|
1517 |
|
2001 | 1518 |
index := 1. |
1519 |
carry := 1. |
|
1520 |
[carry ~~ 0] whileTrue:[ |
|
1521 |
(index <= lResult) ifTrue:[ |
|
1522 |
carry := (resultDigitByteArray basicAt:index) + carry. |
|
1523 |
]. |
|
1524 |
resultDigitByteArray basicAt:index put:(carry bitAnd:16rFF). |
|
1525 |
carry := carry bitShift:-8. |
|
1526 |
index := index + 1 |
|
1527 |
]. |
|
701 | 1528 |
]. |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1529 |
^ result compressed |
1408
e9db184b34ee
oops - large-minus was wrong when sign changes
Claus Gittinger <cg@exept.de>
parents:
1295
diff
changeset
|
1530 |
|
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1531 |
"Modified: 5.11.1996 / 14:09:25 / cg" |
701 | 1532 |
! |
1533 |
||
68 | 1534 |
absMul:aLargeInteger |
1535 |
"return a LargeInteger representing abs(self) * abs(theArgument)" |
|
1536 |
||
92 | 1537 |
|result otherDigitByteArray resultDigitByteArray ok |
68 | 1538 |
idx "{ Class: SmallInteger }" |
1539 |
carry "{ Class: SmallInteger }" |
|
1540 |
len1 "{ Class: SmallInteger }" |
|
1541 |
len2 "{ Class: SmallInteger }" |
|
1542 |
dstIndex "{ Class: SmallInteger }" |
|
77 | 1543 |
prod "{ Class: SmallInteger }" |
1544 |
v "{ Class: SmallInteger }"| |
|
68 | 1545 |
|
1546 |
len1 := digitByteArray size. |
|
1547 |
otherDigitByteArray := aLargeInteger digits. |
|
1548 |
len2 := otherDigitByteArray size. |
|
1549 |
||
1550 |
result := LargeInteger basicNew numberOfDigits:(len1 + len2 + 1). |
|
1551 |
resultDigitByteArray := result digits. |
|
92 | 1552 |
ok := false. |
1553 |
%{ |
|
1133 | 1554 |
if (__isByteArray(__INST(digitByteArray)) |
92 | 1555 |
&& __isByteArray(otherDigitByteArray) |
1556 |
&& __isByteArray(resultDigitByteArray) |
|
250 | 1557 |
&& __bothSmallInteger(len1, len2)) { |
2001 | 1558 |
unsigned char *myBytes = __ByteArrayInstPtr(__INST(digitByteArray))->ba_element; |
1559 |
unsigned char *otherBytes = __ByteArrayInstPtr(otherDigitByteArray)->ba_element; |
|
1560 |
unsigned char *resultBytes = __ByteArrayInstPtr(resultDigitByteArray)->ba_element; |
|
1561 |
int _index1, _index2, _dstIndex, _idx; |
|
1562 |
unsigned _prod, _carry, _v; |
|
68 | 1563 |
|
2001 | 1564 |
for (_index1 = 0; _index1 < __intVal(len1); _index1++) { |
1565 |
for (_index2 = 0; _index2 < __intVal(len2); _index2++) { |
|
1566 |
_dstIndex = _index1 + _index2; |
|
1567 |
_prod = myBytes[_index1] * otherBytes[_index2]; |
|
1568 |
_prod += resultBytes[_dstIndex]; |
|
1569 |
resultBytes[_dstIndex] = _prod & 0xFF; |
|
1570 |
_carry = _prod >> 8; |
|
1571 |
if (_carry) { |
|
1572 |
_idx = _dstIndex + 1; |
|
1573 |
while (_carry) { |
|
1574 |
_v = resultBytes[_idx] + _carry; |
|
1575 |
resultBytes[_idx] = _v & 0xFF; |
|
1576 |
_carry = _v >> 8; |
|
1577 |
_idx = _idx + 1; |
|
1578 |
} |
|
1579 |
} |
|
1580 |
} |
|
1581 |
} |
|
1582 |
ok = true; |
|
92 | 1583 |
} |
1584 |
%}. |
|
1585 |
ok ifFalse:[ |
|
2001 | 1586 |
1 to:len1 do:[:index1 | |
1587 |
1 to:len2 do:[:index2 | |
|
1588 |
dstIndex := index1 + index2 - 1. |
|
1589 |
prod := (digitByteArray basicAt:index1) * (otherDigitByteArray basicAt:index2). |
|
1590 |
prod := prod + (resultDigitByteArray basicAt:dstIndex). |
|
1591 |
resultDigitByteArray basicAt:dstIndex put:(prod bitAnd:16rFF). |
|
1592 |
carry := prod bitShift:-8. |
|
1593 |
carry ~~ 0 ifTrue:[ |
|
1594 |
idx := dstIndex + 1. |
|
1595 |
[carry ~~ 0] whileTrue:[ |
|
1596 |
v := (resultDigitByteArray basicAt:idx) + carry. |
|
1597 |
resultDigitByteArray basicAt:idx put:(v bitAnd:255). |
|
1598 |
carry := v bitShift:-8. |
|
1599 |
idx := idx + 1 |
|
1600 |
] |
|
1601 |
] |
|
1602 |
] |
|
1603 |
]. |
|
68 | 1604 |
]. |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1605 |
^ result compressed |
68 | 1606 |
! |
1607 |
||
1608 |
absPlus:aLargeInteger |
|
1609 |
"return a LargeInteger representing abs(self) + abs(theArgument)" |
|
1610 |
||
1611 |
|result done otherDigitByteArray resultDigitByteArray |
|
1612 |
len1 "{ Class: SmallInteger }" |
|
1613 |
len2 "{ Class: SmallInteger }" |
|
1614 |
index "{ Class: SmallInteger }" |
|
1615 |
carry "{ Class: SmallInteger }" |
|
1616 |
sum "{ Class: SmallInteger }" | |
|
1617 |
||
1618 |
len1 := digitByteArray size. |
|
1619 |
otherDigitByteArray := aLargeInteger digits. |
|
1620 |
len2 := otherDigitByteArray size. |
|
1621 |
||
92 | 1622 |
result := self class basicNew numberOfDigits:((len1 max: len2) + 1). |
68 | 1623 |
resultDigitByteArray := result digits. |
1624 |
||
1625 |
index := 1. |
|
1626 |
carry := 0. |
|
1627 |
||
1628 |
done := false. |
|
1629 |
[done] whileFalse:[ |
|
2001 | 1630 |
sum := carry. |
1631 |
(index <= len1) ifTrue:[ |
|
1632 |
sum := sum + (digitByteArray basicAt:index). |
|
1633 |
(index <= len2) ifTrue:[ |
|
1634 |
sum := sum + (otherDigitByteArray basicAt:index) |
|
1635 |
] |
|
1636 |
] ifFalse:[ |
|
1637 |
(index <= len2) ifTrue:[ |
|
1638 |
sum := sum + (otherDigitByteArray basicAt:index) |
|
1639 |
] ifFalse:[ |
|
1640 |
"end reached" |
|
1641 |
done := true |
|
1642 |
] |
|
1643 |
]. |
|
1644 |
(sum >= 16r100) ifTrue:[ |
|
1645 |
carry := 1. |
|
1646 |
sum := sum - 16r100 |
|
1647 |
] ifFalse:[ |
|
1648 |
carry := 0 |
|
1649 |
]. |
|
1650 |
resultDigitByteArray basicAt:index put:sum. |
|
1651 |
index := index + 1 |
|
68 | 1652 |
]. |
1883
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1653 |
^ result compressed |
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1654 |
|
d3fbf4b36be7
renamed #normalize to #compressed (ST_80 compat)
Claus Gittinger <cg@exept.de>
parents:
1857
diff
changeset
|
1655 |
"Modified: 5.11.1996 / 14:09:34 / cg" |
68 | 1656 |
! |
1657 |
||
1890 | 1658 |
absSubtract:aLargeInteger |
1659 |
"destructively subtract aLargeInteger from myself. |
|
1660 |
A helper for division; only allowed for positive receiver |
|
1661 |
and argument. The receiver must be >= the argument. |
|
1662 |
The receiver must be a temporary scratch-number" |
|
1663 |
||
1664 |
|result done |
|
1665 |
otherDigitByteArray resultDigitByteArray |
|
1666 |
len1 "{ Class: SmallInteger }" |
|
1667 |
len2 "{ Class: SmallInteger }" |
|
1668 |
index "{ Class: SmallInteger }" |
|
1669 |
borrow "{ Class: SmallInteger }" |
|
1670 |
diff "{ Class: SmallInteger }" |
|
1671 |
carry "{ Class: SmallInteger }" |
|
1672 |
lResult nonZero| |
|
1673 |
||
1674 |
len1 := digitByteArray size. |
|
1675 |
otherDigitByteArray := aLargeInteger digits. |
|
1676 |
len2 := otherDigitByteArray size. |
|
1677 |
len2 > len1 ifTrue:[ |
|
2001 | 1678 |
[(otherDigitByteArray at:len2) == 0] whileTrue:[ |
1679 |
len2 := len2 - 1 |
|
1680 |
]. |
|
1681 |
len2 > len1 ifTrue:[ |
|
1682 |
self halt "/ may not be called that way |
|
1683 |
]. |
|
1890 | 1684 |
]. |
1685 |
||
1686 |
nonZero := false. |
|
1687 |
index := 1. |
|
1688 |
borrow := 0. |
|
1689 |
||
1690 |
done := false. |
|
1691 |
[index <= len1] whileTrue:[ |
|
2001 | 1692 |
diff := borrow. |
1693 |
diff := diff + (digitByteArray basicAt:index). |
|
1694 |
index <= len2 ifTrue:[ |
|
1695 |
diff := diff - (otherDigitByteArray basicAt:index). |
|
1696 |
]. |
|
1890 | 1697 |
|
2001 | 1698 |
"/ workaround for |
1699 |
"/ gcc code generator bug |
|
1890 | 1700 |
|
2001 | 1701 |
(diff >= 0) ifTrue:[ |
1702 |
borrow := 0 |
|
1703 |
] ifFalse:[ |
|
1704 |
borrow := -1. |
|
1705 |
diff := diff + 16r100 |
|
1706 |
]. |
|
1707 |
diff ~~ 0 ifTrue:[ |
|
1708 |
nonZero := true |
|
1709 |
]. |
|
1710 |
digitByteArray basicAt:index put:diff. |
|
1711 |
index := index + 1 |
|
1890 | 1712 |
]. |
1713 |
^ nonZero |
|
1714 |
||
1715 |
"Created: 5.11.1996 / 16:23:47 / cg" |
|
1716 |
"Modified: 5.11.1996 / 18:56:50 / cg" |
|
1717 |
! |
|
1718 |
||
1719 |
div2 |
|
1720 |
"destructively divide the receiver by 2. |
|
1721 |
private - used for division only. |
|
1722 |
This is worth a primitive." |
|
1723 |
||
1724 |
%{ /* NOCONTEXT */ |
|
1725 |
OBJ __digits = __INST(digitByteArray); |
|
1726 |
||
1727 |
if (__isByteArray(__digits)) { |
|
2001 | 1728 |
int __nBytes = __byteArraySize(__digits); |
1729 |
unsigned char *__bp = __ByteArrayInstPtr(__digits)->ba_element; |
|
1730 |
unsigned __this, __next; |
|
1731 |
int __idx; |
|
1890 | 1732 |
|
2001 | 1733 |
if (__nBytes == 1) { |
1734 |
__bp[0] >>= 1; |
|
1735 |
RETURN (self); |
|
1736 |
} |
|
1890 | 1737 |
|
2001 | 1738 |
__idx = 1; |
1890 | 1739 |
|
2001 | 1740 |
if ((__idx+4) < __nBytes) { |
1741 |
__this = ((unsigned long *)__bp)[0]; |
|
68 | 1742 |
|
2001 | 1743 |
while ((__idx+4) < __nBytes) { |
1744 |
__next = ((unsigned long *)__bp)[1]; |
|
1745 |
__this >>= 1; |
|
1746 |
__this |= __next << 31; |
|
1747 |
((unsigned long *)__bp)[0] = __this; |
|
1748 |
__this = __next; |
|
1749 |
__bp += 4; |
|
1750 |
__idx += 4; |
|
1751 |
} |
|
1752 |
} |
|
1890 | 1753 |
|
2001 | 1754 |
__this = __bp[0]; |
1755 |
while (__idx < __nBytes) { |
|
1756 |
__next = __bp[1]; |
|
1757 |
__this >>= 1; |
|
1758 |
__this |= __next << 7; |
|
1759 |
__bp[0] = __this; |
|
1760 |
__this = __next; |
|
1761 |
__bp++; |
|
1762 |
__idx++; |
|
1763 |
} |
|
1764 |
__bp[0] = __this >> 1; |
|
1765 |
RETURN (self); |
|
1890 | 1766 |
} |
1767 |
%}. |
|
1768 |
self primitiveFailed |
|
1769 |
||
1770 |
" |
|
1771 |
100000 asLargeInteger div2 |
|
1772 |
" |
|
1773 |
||
1774 |
"Modified: 5.11.1996 / 16:12:56 / cg" |
|
1775 |
! |
|
1776 |
||
1777 |
mul2 |
|
1778 |
"destructively multiply the receiver by 2. |
|
1779 |
private - used for division only. |
|
1780 |
This is worth a primitive." |
|
1781 |
||
1782 |
|nBytes "{ Class: SmallInteger }" |
|
1783 |
b "{ Class: SmallInteger }" |
|
1784 |
t| |
|
1785 |
||
1786 |
nBytes := digitByteArray size. |
|
1787 |
||
1788 |
b := digitByteArray at:nBytes. |
|
1789 |
(b bitAnd:16r80) ~~ 0 ifTrue:[ |
|
2001 | 1790 |
"/ need another byte |
1791 |
nBytes := nBytes + 1. |
|
1792 |
t := ByteArray uninitializedNew:nBytes. |
|
1793 |
t replaceFrom:1 with:digitByteArray startingAt:1. |
|
1794 |
t at:nBytes put:0. |
|
1795 |
digitByteArray := t. |
|
1890 | 1796 |
]. |
1797 |
||
1798 |
%{ |
|
1799 |
OBJ __digits = __INST(digitByteArray); |
|
1800 |
||
1801 |
if (__isByteArray(__digits)) { |
|
2001 | 1802 |
int __nBytes = __intVal(nBytes); |
1803 |
unsigned char *__bp = __ByteArrayInstPtr(__digits)->ba_element; |
|
1804 |
unsigned __carry = 0, __newCarry, __this; |
|
1805 |
int __idx; |
|
1890 | 1806 |
|
2001 | 1807 |
while (__nBytes >= 4) { |
1808 |
__this = ((unsigned long *)__bp)[0]; |
|
1809 |
__newCarry = __this >> 31; |
|
1810 |
((unsigned long *)__bp)[0] = (__this << 1) | __carry; |
|
1811 |
__carry = __newCarry; |
|
1812 |
__bp += 4; |
|
1813 |
__nBytes -= 4; |
|
1814 |
} |
|
1815 |
while (__nBytes) { |
|
1816 |
__this = __bp[0]; |
|
1817 |
__newCarry = __this >> 7; |
|
1818 |
__bp[0] = (__this << 1) | __carry; |
|
1819 |
__carry = __newCarry; |
|
1820 |
__bp ++; |
|
1821 |
__nBytes--; |
|
1822 |
} |
|
1823 |
RETURN (self); |
|
1890 | 1824 |
} |
1825 |
%}. |
|
1826 |
self primitiveFailed |
|
1827 |
||
1828 |
" |
|
1829 |
100000 asLargeInteger mul2 |
|
1830 |
" |
|
1831 |
||
1832 |
"Modified: 5.11.1996 / 16:37:32 / cg" |
|
68 | 1833 |
! |
1834 |
||
1835 |
mul256 |
|
1836 |
"destructively multiply the receiver by 256. |
|
1837 |
private - used for division only" |
|
1838 |
||
1839 |
|newDigits| |
|
1840 |
||
359 | 1841 |
newDigits := ByteArray uninitializedNew:(digitByteArray size + 1). |
68 | 1842 |
newDigits replaceFrom:2 with:digitByteArray startingAt:1. |
1843 |
newDigits at:1 put:0. |
|
1844 |
digitByteArray := newDigits |
|
701 | 1845 |
! |
68 | 1846 |
|
701 | 1847 |
numberOfDigits:nDigits |
2001 | 1848 |
"/ digitByteArray := ByteArray uninitializedNew:nDigits. |
701 | 1849 |
digitByteArray := ByteArray new:nDigits. |
1850 |
sign := 1. |
|
68 | 1851 |
! |
1852 |
||
701 | 1853 |
setDigits:digits |
1854 |
digitByteArray := digits. |
|
1855 |
sign := 1. |
|
68 | 1856 |
! |
1857 |
||
701 | 1858 |
sign:aNumber |
1859 |
sign := aNumber |
|
1 | 1860 |
! ! |
1861 |
||
1862 |
!LargeInteger methodsFor:'testing'! |
|
1863 |
||
701 | 1864 |
even |
1865 |
"return true if the receiver is even" |
|
1 | 1866 |
|
701 | 1867 |
^ (digitByteArray at:1) even |
1 | 1868 |
! |
1869 |
||
68 | 1870 |
negative |
1871 |
"return true, if the receiver is < 0" |
|
1872 |
||
1873 |
^ (sign < 0) |
|
1874 |
! |
|
1875 |
||
1 | 1876 |
odd |
1877 |
"return true if the receiver is odd" |
|
1878 |
||
1983 | 1879 |
^ (digitByteArray at:1) odd |
1880 |
||
1881 |
"Modified: 18.11.1996 / 22:19:19 / cg" |
|
1 | 1882 |
! |
1883 |
||
1884 |
positive |
|
1885 |
"return true, if the receiver is >= 0" |
|
1886 |
||
1887 |
^ (sign >= 0) |
|
1888 |
! |
|
1889 |
||
701 | 1890 |
sign |
1891 |
"return the sign of the receiver" |
|
1892 |
||
1893 |
^ sign |
|
1894 |
! |
|
1895 |
||
1 | 1896 |
strictlyPositive |
1897 |
"return true, if the receiver is > 0" |
|
1898 |
||
1899 |
^ (sign > 0) |
|
1900 |
! ! |
|
1901 |
||
1794 | 1902 |
!LargeInteger class methodsFor:'documentation'! |
1 | 1903 |
|
701 | 1904 |
version |
2471
035dbf8db9f3
faster large*small on i386 - use 32*32->64 bit multiplication.
Claus Gittinger <cg@exept.de>
parents:
2267
diff
changeset
|
1905 |
^ '$Header: /cvs/stx/stx/libbasic/Attic/LargeInt.st,v 1.42 1997-03-20 20:17:44 cg Exp $' |
1 | 1906 |
! ! |