Skip to content

Commit 752bfb7

Browse files
author
Stefan Krah
committed
Remove trailing whitespace.
1 parent ce55f08 commit 752bfb7

11 files changed

Lines changed: 23 additions & 23 deletions

File tree

Modules/_decimal/README.txt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@ It is possible to override autodetection by exporting:
3737

3838
NOTE
3939
====
40-
40+
4141
decimal.so is not built from a static libmpdec.a since doing so led to
4242
failures on AIX (user report) and Windows (mixing static and dynamic CRTs
4343
causes locale problems and more).

Modules/_decimal/libmpdec/README.txt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -79,7 +79,7 @@ Pointers to literature, proofs and more
7979
mulmod-ppro.txt -> Proof for the x87 FPU modular multiplication
8080
from umodarith.h.
8181
umodarith.lisp -> ACL2 proofs for many functions from umodarith.h.
82-
82+
8383

8484
Library Author
8585
==============

Modules/_decimal/libmpdec/io.c

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -352,7 +352,7 @@ word_to_string(char *s, mpd_uint_t x, int n, char *dot)
352352
case 2: EXTRACT_DIGIT(s, x, 10UL, dot);
353353
default: if (s == dot) *s++ = '.'; *s++ = '0' + (char)x;
354354
}
355-
355+
356356
*s = '\0';
357357
return s;
358358
}
@@ -1059,7 +1059,7 @@ _mpd_add_sep_dot(mpd_mbstr_t *dest,
10591059
* Not allowed, since _mpd_to_string() never returns this form:
10601060
*
10611061
* 3) [sign] '.' digits [exponent-part]
1062-
*
1062+
*
10631063
* Input: result->data := original numeric string (ASCII)
10641064
* result->bytes := strlen(result->data)
10651065
* result->nchars := strlen(result->data)

Modules/_decimal/libmpdec/literature/bignum.txt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ Convolution in pseudo-code:
2323
y = fnt(b) # forward transform of b
2424
z = pairwise multiply x[i] and y[i]
2525
result = inv_fnt(z) # backward transform of z.
26-
26+
2727

2828
Extending the maximum transform length (Chinese Remainder Theorem):
2929
-------------------------------------------------------------------

Modules/_decimal/libmpdec/literature/matrix-transform.txt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -245,7 +245,7 @@ Proof (inverse transform):
245245
which means that all A[k] = A[m * C + n] are in the correct order.
246246

247247

248-
--
248+
--
249249

250250
[1] Joerg Arndt: "Matters Computational"
251251
http://www.jjj.de/fxt/

Modules/_decimal/libmpdec/literature/mulmod-ppro.txt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -251,7 +251,7 @@ Proof.
251251

252252
apply Qlt_le_trans with (y := 1).
253253
qreduce ((2 # 1) ^ (-62) + (2 # 1) ^ (-126)).
254-
254+
255255
rewrite Qlt_mult_by_z with (z := 85070591730234615865843651857942052864 # 18446744073709551617).
256256
ring_simplify.
257257

Modules/_decimal/libmpdec/literature/six-step.txt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -55,7 +55,7 @@ Transform.
5555

5656

5757

58-
--
58+
--
5959

6060
[1] David H. Bailey: FFTs in External or Hierarchical Memory
6161
http://crd.lbl.gov/~dhbailey/dhbpapers/

Modules/_decimal/libmpdec/literature/umodarith.lisp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -321,7 +321,7 @@
321321

322322
(defthmd dw-submod-correct
323323
(implies (and (< 0 m) (< m base)
324-
(natp a) (< a m)
324+
(natp a) (< a m)
325325
(< hi base) (< lo base)
326326
(natp m) (natp base)
327327
(natp hi) (natp lo))

Modules/_decimal/libmpdec/mpdecimal.c

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -3119,7 +3119,7 @@ _mpd_qaddsub(mpd_t *result, const mpd_t *a, const mpd_t *b, uint8_t sign_b,
31193119
* ----------XX1234 -> sdigits
31203120
* ----------X1 -> tiny-digits
31213121
* |- prec -|
3122-
*
3122+
*
31233123
* OR
31243124
*
31253125
* bdigits > prec AND
@@ -5983,7 +5983,7 @@ _mpd_qpow_int(mpd_t *result, const mpd_t *base, const mpd_t *exp,
59835983
mpd_qfinalize(result, ctx, status);
59845984
}
59855985

5986-
/*
5986+
/*
59875987
* If the exponent is infinite and base equals one, the result is one
59885988
* with a coefficient of length prec. Otherwise, result is undefined.
59895989
* Return the value of the comparison against one.
@@ -7129,7 +7129,7 @@ _mpd_base_ndivmod(mpd_t *q, mpd_t *r, const mpd_t *a, const mpd_t *b,
71297129
goto nanresult;
71307130
}
71317131

7132-
/* Let x := _mpd_qreciprocal(b, prec)
7132+
/* Let x := _mpd_qreciprocal(b, prec)
71337133
* Then x is bounded by:
71347134
* 1) 1/b - 10**(-prec - bdigits) < x < 1/b + 10**(-prec - bdigits)
71357135
* 2) 1/b - 10**(-adigits - 4) < x < 1/b + 10**(-adigits - 4)

Modules/_decimal/libmpdec/umodarith.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -93,7 +93,7 @@ ext_submod(mpd_uint_t a, mpd_uint_t b, mpd_uint_t m)
9393
return d;
9494
}
9595

96-
/*
96+
/*
9797
* Reduce double word modulo m.
9898
* Restrictions: m != 0
9999
* ACL2 proof: umodarith.lisp: section dw-reduce

0 commit comments

Comments
 (0)