diff options
| author | flywind <xzsflywind@gmail.com> | 2021-02-21 21:53:28 -0600 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-02-21 19:53:28 -0800 |
| commit | 455690157250e9108819a3cb32a574da48d0f9c9 (patch) | |
| tree | 9f4300fb63fefea8818122d43b7cbf4ed57e8ee7 /lib/std/sums.nim | |
| parent | 4f10dde64a504d982ef0e1d46e42f506a9a88a1b (diff) | |
| download | Nim-455690157250e9108819a3cb32a574da48d0f9c9.tar.gz | |
use single backtick (#17141)
Diffstat (limited to 'lib/std/sums.nim')
| -rw-r--r-- | lib/std/sums.nim | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/std/sums.nim b/lib/std/sums.nim index 5f4f74f0a..b68858ef7 100644 --- a/lib/std/sums.nim +++ b/lib/std/sums.nim @@ -60,7 +60,7 @@ func sumPairwise[T](x: openArray[T], i0, n: int): T = result = sumPairwise(x, i0, n2) + sumPairwise(x, i0 + n2, n - n2) func sumPairs*[T](x: openArray[T]): T = - ## Pairwise (cascade) summation of ``x[i0:i0+n-1]``, with O(log n) error growth + ## Pairwise (cascade) summation of `x[i0:i0+n-1]`, with O(log n) error growth ## (vs O(n) for a simple loop) with negligible performance cost if ## the base case is large enough. ## |