/usr/include/yacas/anumber.inl is in yacas 1.3.6-2+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 | #include "anumber.h"
/* BaseTimesInt : multiply a with one digit in the range 0..(aBase-1)
*/
template<class T>
inline void BaseTimesInt(T& a,PlatDoubleWord aNumber, PlatDoubleWord aBase)
{
PlatDoubleWord carry=0;
LispInt i;
LispInt nr=a.size();
typename T::value_type * aptr = &a[0];
for (i=0;i<nr;i++)
{
PlatDoubleWord word = ((PlatDoubleWord)(*aptr))*aNumber+carry;
PlatWord digit = (PlatWord)(word % aBase);
PlatWord newCarry= (PlatWord)(word / aBase);
*aptr = digit;
aptr++;
carry= newCarry;
}
if (carry)
{
a.push_back((typename T::value_type)carry);
carry = 0;
}
assert(carry == 0);
}
template<class T>
inline void WordBaseTimesInt(T& a,PlatDoubleWord aNumber)
{
PlatDoubleWord carry=0;
LispInt i;
LispInt nr=a.size();
typename T::value_type * aptr = &a[0];
for (i=0;i<nr;i++)
{
PlatDoubleWord word = ((PlatDoubleWord)(*aptr))*aNumber+carry;
PlatWord digit = (PlatWord)(word);
PlatWord newCarry= (PlatWord)(word >> WordBits);
*aptr = digit;
aptr++;
carry= newCarry;
}
if (carry)
{
a.push_back((typename T::value_type)carry);
carry = 0;
}
assert(carry == 0);
}
template<class T>
inline void BaseDivideInt(T& a,PlatDoubleWord aNumber, PlatDoubleWord aBase, PlatDoubleWord& aCarry)
{
// if (a[a.size()-1] != 0)
PlatDoubleWord carry=0;
LispInt i;
LispInt nr=a.size();
typename T::value_type * aptr = &a[0];
for (i=nr-1;i>=0;i--)
{
PlatDoubleWord word = ((carry*aBase)+((PlatDoubleWord)(aptr[i])));
PlatWord digit = (PlatWord)(word / aNumber);
PlatWord newCarry= (PlatWord)(word % aNumber);
aptr[i] = digit;
carry= newCarry;
}
//carry now is the remainder
aCarry = carry;
}
/* GrowDigits : add digits to a until it has aDigits digits
*/
template<class T>
inline void GrowDigits(T& a, std::size_t aDigits)
{
if (aDigits <= a.size())
return;
a.resize(aDigits, 0);
}
/* BaseAdd : destructively add aSource to aTarget, in base aBase.
*/
template<class T>
inline void BaseAdd(T& aTarget, const T& aSource, PlatDoubleWord aBase)
{
// Initialize result
GrowDigits(aTarget,aSource.size());
aTarget.push_back(0);
LispInt nr1 = aTarget.size();
LispInt nr2 = aSource.size();
LispInt nr;
// nr represents min(nr1,nr2), the number of digits to add
if (nr1>nr2)
nr=nr2;
else
nr=nr1;
PlatDoubleWord carry=0;
LispInt digit;
const typename T::value_type * sourcePtr = &aSource[0];
typename T::value_type * targetPtr = &aTarget[0];
for (digit=0;digit<nr;digit++)
{
PlatDoubleWord word;
word = (PlatDoubleWord)targetPtr[digit] +
(PlatDoubleWord)sourcePtr[digit] + carry;
PlatDoubleWord newDigit = (word%aBase);
PlatDoubleWord newCarry = (word/aBase);
targetPtr[digit] = (typename T::value_type)newDigit;
carry = newCarry;
}
while (carry != 0)
{
PlatSignedDoubleWord ww = targetPtr[nr];
ww+=carry;
targetPtr[nr] = (typename T::value_type)(ww%aBase); // PDG - cast to avoid compile-time warning
carry = ww/aBase;
nr++;
}
}
template<class T>
inline void WordBaseAdd(T& aTarget, const T& aSource)
{
// Initialize result
GrowDigits(aTarget,aSource.size());
aTarget.push_back(0);
LispInt nr1 = aTarget.size();
LispInt nr2 = aSource.size();
LispInt nr;
// nr represents min(nr1,nr2), the number of digits to add
if (nr1>nr2)
nr=nr2;
else
nr=nr1;
PlatDoubleWord carry=0;
LispInt digit;
const typename T::value_type * sourcePtr = &aSource[0];
typename T::value_type * targetPtr = &aTarget[0];
for (digit=0;digit<nr;digit++)
{
PlatDoubleWord word;
word = (PlatDoubleWord)targetPtr[digit] +
(PlatDoubleWord)sourcePtr[digit] + carry;
PlatWord newDigit = (PlatWord)(word);
PlatWord newCarry = (PlatWord)(word >> WordBits);
targetPtr[digit] = (typename T::value_type)newDigit;
carry = newCarry;
}
while (carry != 0)
{
PlatSignedDoubleWord ww = targetPtr[nr];
ww+=carry;
targetPtr[nr] = (typename T::value_type)ww; // PDG - cast to avoid compile-time warning
carry = ww >> WordBits;
nr++;
}
}
template<class T>
inline void BaseSubtract(T& aResult, T& a2, LispInt offset)
{
if (a2.IsZero())
return;
// Initialize result
LispInt nr = a2.size();
typename T::value_type * resultPtr = &aResult[0];
typename T::value_type * a2ptr = &a2[0];
while (a2ptr[nr-1] == 0)
nr--;
// Subtract on a per-digit basis
PlatSignedDoubleWord carry=0;
LispInt digit;
for (digit=0;digit<nr;digit++)
{
PlatSignedDoubleWord word;
word = ((PlatSignedDoubleWord)resultPtr[digit+offset]) -
((PlatSignedDoubleWord)a2ptr[digit]) +
(PlatSignedDoubleWord)carry;
carry=0;
while (word<0)
{
word+=WordBase;
carry--;
}
resultPtr[digit+offset] = ((PlatWord)(word));
}
while (carry != 0)
{
assert(nr+offset<aResult.size());
LispInt newCarry = 0;
PlatSignedDoubleWord ww = resultPtr[nr+offset]+carry;
while (ww<0)
{
ww = ww + WordBase;
newCarry = newCarry - 1;
}
resultPtr[nr+offset]=(typename T::value_type)ww;
carry = newCarry;
offset++;
}
}
/* BaseIntNumber : convert a number into a different base,
*/
inline void BaseIntNumber(std::string& aTarget, PlatSignedDoubleWord aNumber, PlatWord aBase)
{
// Assume aBase is an integer > 0.
// Assume aNumber is an integer > 0.
// Assume PlatDoubleWord is an integer type.
// Will maximum digit (i.e., aBase-1) convert to T::value_type right?
//LISPASSERT( (typename T::value_type)(aBase) == (aBase) ); // use aBase instead, to help CTCE
aTarget.resize(0);
while (aNumber != 0)
{
PlatDoubleWord digit = aNumber%aBase;
aTarget.push_back((LispString::value_type)(digit));
aNumber/=aBase;
}
if (aTarget.size() == 0)
aTarget.push_back(0);
}
// BaseAddMultiply : multiply x and y, and add result to aTarget
//
inline void BaseAddMultiply(std::string& aTarget, std::string& x, std::string& y, PlatDoubleWord aBase)
{
LispInt nrx=x.size();
LispInt nry=y.size();
GrowDigits(aTarget,nrx+nry+1);
LispInt ix,iy;
std::string::value_type *targetPtr = &aTarget[0];
std::string::value_type *xPtr = &x[0];
std::string::value_type *yPtr = &y[0];
for (ix=0;ix<nrx;ix++)
{
PlatDoubleWord carry = 0;
for (iy=0;iy<nry;iy++)
{
PlatDoubleWord word =
static_cast<PlatDoubleWord>(targetPtr[ix+iy])+
static_cast<PlatDoubleWord>(xPtr[ix])*
static_cast<PlatDoubleWord>(yPtr[iy])+carry;
// This calculates aTarget[ix+iy]+x[ix]*y[iy]+carry;
targetPtr[ix+iy] = (LispString::value_type)(word % aBase);
carry = word / aBase;
}
targetPtr[ix+nry] += (LispString::value_type)(carry);
}
}
template<class T>
inline void WordBaseAddMultiply(T& aTarget, T& x, T& y)
{
LispInt nrx=x.size();
LispInt nry=y.size();
GrowDigits(aTarget,nrx+nry+1);
LispInt ix,iy;
typename T::value_type *targetPtr = &aTarget[0];
typename T::value_type *xPtr = &x[0];
typename T::value_type *yPtr = &y[0];
for (ix=0;ix<nrx;ix++)
{
PlatDoubleWord carry = 0;
for (iy=0;iy<nry;iy++)
{
PlatDoubleWord word =
static_cast<PlatDoubleWord>(targetPtr[ix+iy])+
static_cast<PlatDoubleWord>(xPtr[ix])*
static_cast<PlatDoubleWord>(yPtr[iy])+carry;
// This calculates aTarget[ix+iy]+x[ix]*y[iy]+carry;
targetPtr[ix+iy] = (typename T::value_type)(word);
carry = word >> WordBits;
}
{
PlatDoubleWord word = static_cast<PlatDoubleWord>(targetPtr[ix+nry])+carry;
targetPtr[ix+nry] = (typename T::value_type)(word);
carry = word >> WordBits;
assert(carry == 0);
// targetPtr[ix+nry] += (typename T::value_type)(carry);
}
}
}
/* BaseMultiply : multiply x and y, and put result in aTarget
*/
template<class T>
inline void BaseMultiply(T& aTarget, T& x, T& y, PlatDoubleWord aBase)
{
aTarget.resize(1);
aTarget[0] = 0;
BaseAddMultiply(aTarget, x, y, aBase);
}
template<class T>
inline void WordBaseMultiply(T& aTarget, T& x, T& y)
{
aTarget.resize(1);
aTarget[0] = 0;
WordBaseAddMultiply(aTarget, x, y);
}
template<class T>
inline bool IsZero(T& a)
{
register typename T::value_type *ptr = &a[0];
register typename T::value_type *endptr = ptr+a.size();
while (ptr != endptr)
{
if (*ptr++ != 0)
return false;
}
return true;
}
template<class T>
inline void WordBaseDivide(T& aQuotient, T& aRemainder, T& a1, T& a2)
{
// Find the values n and m as described in Knuth II:
LispInt n,m;
n=a2.size();
assert(n>0);
assert(a2[n-1] != 0);
//a1.size() = m+n => m = a1.size()-n
m = a1.size()-n;
assert(m>=0);
aQuotient.resize(m+1);
//D1:
//this calculates d = base/(a2[n-1]+1);
PlatDoubleWord d = WordBase/(static_cast<PlatDoubleWord>(a2[n-1])+1);
WordBaseTimesInt(a1, d);
WordBaseTimesInt(a2, d);
a1.push_back(0);
a2.push_back(0);
//D2:
LispInt j = m;
while (j>=0)
{
//D3:
PlatDoubleWord q = (a1[j+n]*WordBase+a1[j+n-1])/a2[n-1];
PlatDoubleWord r = (a1[j+n]*WordBase+a1[j+n-1])%a2[n-1];
REDO:
if (q == WordBase || q*a2[n-2] > WordBase*r+a1[j+n-2])
{
q = q - 1;
r = r + a2[n-1];
if (r < WordBase)
goto REDO;
}
//D4:
ANumber sub(aQuotient.Precision());
sub.CopyFrom(a2);
WordBaseTimesInt(sub, q);
sub.push_back(0);
PlatSignedDoubleWord carry;
LispInt digit;
{//Subtract the two
//TODO this can be generalized!!!!
//
// Beware though: this is not a normal subtraction. Only a
// certain set of digits ends up being subtracted.
// First check if qv isn't too big...
carry = 0;
for (digit=0;digit<=n;digit++)
{
PlatSignedDoubleWord word;
word = ((PlatSignedDoubleWord)a1[digit+j]) -
((PlatSignedDoubleWord)sub[digit]) +
(PlatSignedDoubleWord)carry;
carry=0;
while (word<0)
{
word+=WordBase;
carry--;
}
}
if (carry)
{
q--;
sub.CopyFrom(a2);
WordBaseTimesInt(sub, q);
sub.push_back(0);
}
carry = 0;
for (digit=0;digit<=n;digit++)
{
PlatSignedDoubleWord word;
word = ((PlatSignedDoubleWord)a1[digit+j]) -
((PlatSignedDoubleWord)sub[digit]) +
(PlatSignedDoubleWord)carry;
carry=0;
while (word<0)
{
word+=WordBase;
carry--;
}
a1[digit+j] = ((PlatWord)(word));
}
}
assert(carry == 0);
//D5:
aQuotient[j] = (typename T::value_type)q;
//D7:
j--;
}
//D8:
a1.resize(n);
PlatDoubleWord carry;
BaseDivideInt(a1, d, WordBase,carry);
aRemainder.CopyFrom(a1);
}
inline
void ANumber::Expand()
{
while (iExp+1>LispInt(size()))
push_back(0);
}
|