mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-30 23:20:29 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix DScanner warnings

Browse source
This commit is contained in:
Sebastian Wilzbach 2018-05-30 13:09:51 +02:00
parent e1cba41bd6
commit a8c0b833bb
4 changed files with 8 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

4
std/algorithm/iteration.d
View file

@ -2791,13 +2791,13 @@ if (fun.length >= 1)
Once S has been determined, then `S s = e;` and `s = f(s, e);`
must both be legal.
If `r` is empty, an `Exception` is thrown.
Params:
r = an iterable value as defined by `isIterable`
Returns:
the final result of the accumulator applied to the iterable
Throws: `Exception` if `r` is empty
+/
auto reduce(R)(R r)
if (isIterable!R)

4
std/internal/digest/sha_SSSE3.d
View file

@ -536,11 +536,11 @@ version(USE_SSSE3)
// Offset into stack (see below)
version(_32Bit)
{
private enum { STATE_OFS = 4, WI_PLUS_KI_PTR = 8, WI_PTR = 72 };
private enum { STATE_OFS = 4, WI_PLUS_KI_PTR = 8, WI_PTR = 72 }
}
version(_64Bit)
{
private enum { WI_PLUS_KI_PTR = 0 };
private enum { WI_PLUS_KI_PTR = 0 }
}
/** The prologue sequence. */

4
std/internal/math/biguintcore.d
View file

@ -206,13 +206,13 @@ enum size_t FASTDIVLIMIT = 100; // crossover to recursive division
// These constants are used by shift operations
static if (BigDigit.sizeof == int.sizeof)
{
enum { LG2BIGDIGITBITS = 5, BIGDIGITSHIFTMASK = 31 };
enum { LG2BIGDIGITBITS = 5, BIGDIGITSHIFTMASK = 31 }
alias BIGHALFDIGIT = ushort;
}
else static if (BigDigit.sizeof == long.sizeof)
{
alias BIGHALFDIGIT = uint;
enum { LG2BIGDIGITBITS = 6, BIGDIGITSHIFTMASK = 63 };
enum { LG2BIGDIGITBITS = 6, BIGDIGITSHIFTMASK = 63 }
}
else static assert(0, "Unsupported BigDigit size");

4
std/internal/math/biguintx86.d
View file

@ -101,8 +101,8 @@ public:
alias BigDigit = uint; // A Bignum is an array of BigDigits. Usually the machine word size.
// Limits for when to switch between multiplication algorithms.
enum : int { KARATSUBALIMIT = 18 }; // Minimum value for which Karatsuba is worthwhile.
enum : int { KARATSUBASQUARELIMIT=26 }; // Minimum value for which square Karatsuba is worthwhile
enum : int { KARATSUBALIMIT = 18 } // Minimum value for which Karatsuba is worthwhile.
enum : int { KARATSUBASQUARELIMIT=26 } // Minimum value for which square Karatsuba is worthwhile
/** Multi-byte addition or subtraction
* dest[#] = src1[#] + src2[#] + carry (0 or 1).