mirror of
https://github.com/dlang/phobos.git
synced 2025-05-01 23:50:31 +03:00
Fix DScanner warnings
This commit is contained in:
parent
e1cba41bd6
commit
a8c0b833bb
4 changed files with 8 additions and 8 deletions
|
@ -2791,13 +2791,13 @@ if (fun.length >= 1)
|
||||||
Once S has been determined, then `S s = e;` and `s = f(s, e);`
|
Once S has been determined, then `S s = e;` and `s = f(s, e);`
|
||||||
must both be legal.
|
must both be legal.
|
||||||
|
|
||||||
If `r` is empty, an `Exception` is thrown.
|
|
||||||
|
|
||||||
Params:
|
Params:
|
||||||
r = an iterable value as defined by `isIterable`
|
r = an iterable value as defined by `isIterable`
|
||||||
|
|
||||||
Returns:
|
Returns:
|
||||||
the final result of the accumulator applied to the iterable
|
the final result of the accumulator applied to the iterable
|
||||||
|
|
||||||
|
Throws: `Exception` if `r` is empty
|
||||||
+/
|
+/
|
||||||
auto reduce(R)(R r)
|
auto reduce(R)(R r)
|
||||||
if (isIterable!R)
|
if (isIterable!R)
|
||||||
|
|
|
@ -536,11 +536,11 @@ version(USE_SSSE3)
|
||||||
// Offset into stack (see below)
|
// Offset into stack (see below)
|
||||||
version(_32Bit)
|
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)
|
version(_64Bit)
|
||||||
{
|
{
|
||||||
private enum { WI_PLUS_KI_PTR = 0 };
|
private enum { WI_PLUS_KI_PTR = 0 }
|
||||||
}
|
}
|
||||||
|
|
||||||
/** The prologue sequence. */
|
/** The prologue sequence. */
|
||||||
|
|
|
@ -206,13 +206,13 @@ enum size_t FASTDIVLIMIT = 100; // crossover to recursive division
|
||||||
// These constants are used by shift operations
|
// These constants are used by shift operations
|
||||||
static if (BigDigit.sizeof == int.sizeof)
|
static if (BigDigit.sizeof == int.sizeof)
|
||||||
{
|
{
|
||||||
enum { LG2BIGDIGITBITS = 5, BIGDIGITSHIFTMASK = 31 };
|
enum { LG2BIGDIGITBITS = 5, BIGDIGITSHIFTMASK = 31 }
|
||||||
alias BIGHALFDIGIT = ushort;
|
alias BIGHALFDIGIT = ushort;
|
||||||
}
|
}
|
||||||
else static if (BigDigit.sizeof == long.sizeof)
|
else static if (BigDigit.sizeof == long.sizeof)
|
||||||
{
|
{
|
||||||
alias BIGHALFDIGIT = uint;
|
alias BIGHALFDIGIT = uint;
|
||||||
enum { LG2BIGDIGITBITS = 6, BIGDIGITSHIFTMASK = 63 };
|
enum { LG2BIGDIGITBITS = 6, BIGDIGITSHIFTMASK = 63 }
|
||||||
}
|
}
|
||||||
else static assert(0, "Unsupported BigDigit size");
|
else static assert(0, "Unsupported BigDigit size");
|
||||||
|
|
||||||
|
|
|
@ -101,8 +101,8 @@ public:
|
||||||
alias BigDigit = uint; // A Bignum is an array of BigDigits. Usually the machine word size.
|
alias BigDigit = uint; // A Bignum is an array of BigDigits. Usually the machine word size.
|
||||||
|
|
||||||
// Limits for when to switch between multiplication algorithms.
|
// Limits for when to switch between multiplication algorithms.
|
||||||
enum : int { KARATSUBALIMIT = 18 }; // Minimum value for which 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
|
enum : int { KARATSUBASQUARELIMIT=26 } // Minimum value for which square Karatsuba is worthwhile
|
||||||
|
|
||||||
/** Multi-byte addition or subtraction
|
/** Multi-byte addition or subtraction
|
||||||
* dest[#] = src1[#] + src2[#] + carry (0 or 1).
|
* dest[#] = src1[#] + src2[#] + carry (0 or 1).
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue