mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-28 22:21:09 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Narrow imports of std.math in the rest of phobos.

Browse source
This commit is contained in:
berni44 2021-04-20 21:01:16 +02:00 • committed by The Dlang Bot
parent d8f3d3a815
commit b2019ebab0
31 changed files with 221 additions and 172 deletions
Download patch file Download diff file Expand all files Collapse all files

4
std/algorithm/comparison.d
View file

@ -985,7 +985,7 @@ template equal(alias pred = "a == b")
@safe @nogc unittest
{
import std.algorithm.comparison : equal;
import std.math : isClose;
import std.math.operations : isClose;
int[4] a = [ 1, 2, 4, 3 ];
assert(!equal(a[], a[1..$]));
@ -1023,7 +1023,7 @@ range of range (of range...) comparisons.
import std.algorithm.iteration : map;
import std.internal.test.dummyrange : ReferenceForwardRange,
ReferenceInputRange, ReferenceInfiniteForwardRange;
import std.math : isClose;
import std.math.operations : isClose;
// various strings
assert(equal("æøå", "æøå")); //UTF8 vs UTF8

30
std/algorithm/iteration.d
View file

@ -1343,7 +1343,7 @@ if (is(typeof(unaryFun!predicate)))
@safe unittest
{
import std.algorithm.comparison : equal;
import std.math : isClose;
import std.math.operations : isClose;
import std.range;
int[] arr = [ 1, 2, 3, 4, 5 ];
@ -2819,7 +2819,7 @@ nothrow pure @system unittest
nothrow @system unittest
{
import std.algorithm.comparison : equal;
import std.math : abs;
import std.math.algebraic : abs;
struct SomeRange
{
@ -2866,7 +2866,7 @@ nothrow @system unittest
nothrow pure @system unittest
{
// Grouping by maximum adjacent difference:
import std.math : abs;
import std.math.algebraic : abs;
import std.algorithm.comparison : equal;
auto r3 = [1, 3, 2, 5, 4, 9, 10].splitWhen!((a, b) => abs(a-b) >= 3);
assert(r3.equal!equal([
@ -4020,7 +4020,7 @@ remarkable power and flexibility.
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.math : isClose;
import std.math.operations : isClose;
import std.range;
int[] arr = [ 1, 2, 3, 4, 5 ];
@ -4075,7 +4075,8 @@ The number of seeds must be correspondingly increased.
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.math : isClose, sqrt;
import std.math.operations : isClose;
import std.math.algebraic : sqrt;
import std.typecons : tuple, Tuple;
double[] a = [ 3.0, 4, 7, 11, 3, 2, 5 ];
@ -4585,7 +4586,7 @@ if (fun.length >= 1)
{
import std.algorithm.comparison : max, min;
import std.array : array;
import std.math : isClose;
import std.math.operations : isClose;
import std.range : chain;
int[] arr = [1, 2, 3, 4, 5];
@ -4641,7 +4642,7 @@ The number of seeds must be correspondingly increased.
{
import std.algorithm.comparison : max, min;
import std.algorithm.iteration : map;
import std.math : isClose;
import std.math.operations : isClose;
import std.typecons : tuple;
double[] a = [3.0, 4, 7, 11, 3, 2, 5];
@ -4696,7 +4697,7 @@ The number of seeds must be correspondingly increased.
{
import std.algorithm.comparison : max, min;
import std.array : array;
import std.math : isClose;
import std.math.operations : isClose;
import std.typecons : tuple;
const float a = 0.0;
@ -4718,7 +4719,7 @@ The number of seeds must be correspondingly increased.
@safe unittest
{
import std.math : isClose;
import std.math.operations : isClose;
import std.typecons : tuple;
enum foo = "a + 0.5 * b";
@ -6956,7 +6957,7 @@ if (isInputRange!R && !isInfinite!R && is(typeof(seed = seed + r.front)))
assert(sum([1F, 2, 3, 4]) == 10);
//Force pair-wise floating point sumation on large integers
import std.math : isClose;
import std.math.operations : isClose;
assert(iota(ulong.max / 2, ulong.max / 2 + 4096).sum(0.0)
.isClose((ulong.max / 2) * 4096.0 + 4096^^2 / 2));
}
@ -7049,7 +7050,7 @@ if (isForwardRange!R && !isRandomAccessRange!R)
private auto sumPairwiseN(size_t N, bool needEmptyChecks, F, R)(ref R r)
if (isForwardRange!R && !isRandomAccessRange!R)
{
import std.math : isPowerOf2;
import std.math.traits : isPowerOf2;
static assert(isPowerOf2(N), "N must be a power of 2");
static if (N == 2) return sumPair!(needEmptyChecks, F)(r);
else return sumPairwiseN!(N/2, needEmptyChecks, F)(r)
@ -7236,7 +7237,8 @@ if (isInputRange!R &&
///
@safe @nogc pure nothrow unittest
{
import std.math : isClose, isNaN;
import std.math.operations : isClose;
import std.math.traits : isNaN;
static immutable arr1 = [1, 2, 3];
static immutable arr2 = [1.5, 2.5, 12.5];
@ -7250,7 +7252,7 @@ if (isInputRange!R &&
@safe pure nothrow unittest
{
import std.internal.test.dummyrange : ReferenceInputRange;
import std.math : isClose;
import std.math.operations : isClose;
auto r1 = new ReferenceInputRange!int([1, 2, 3]);
assert(r1.mean.isClose(2));
@ -7264,7 +7266,7 @@ if (isInputRange!R &&
{
import std.bigint : BigInt;
import std.internal.test.dummyrange : ReferenceInputRange;
import std.math : isClose;
import std.math.operations : isClose;
auto bigint_arr = [BigInt("1"), BigInt("2"), BigInt("3"), BigInt("6")];
auto bigint_arr2 = new ReferenceInputRange!BigInt([

2
std/algorithm/searching.d
View file

@ -1424,7 +1424,7 @@ if (isInputRange!Range && !isInfinite!Range &&
assert([[0, 4], [1, 2]].extremum!("a[1]", "a > b") == [0, 4]);
// use a custom comparator
import std.math : cmp;
import std.math.operations : cmp;
assert([-2., 0, 5].extremum!cmp == 5.0);
assert([-2., 0, 2].extremum!`cmp(a, b) < 0` == -2.0);

5
std/algorithm/sorting.d
View file

@ -1990,7 +1990,8 @@ if (((ss == SwapStrategy.unstable && (hasSwappableElements!Range ||
double[] numbers = [-0.0, 3.0, -2.0, double.nan, 0.0, -double.nan];
import std.algorithm.comparison : equal;
import std.math : cmp, isIdentical;
import std.math.operations : cmp;
import std.math.traits : isIdentical;
sort!((a, b) => cmp(a, b) < 0)(numbers);
@ -4779,7 +4780,7 @@ shapes. Here's a non-trivial example:
*/
@safe unittest
{
import std.math : sqrt;
import std.math.algebraic : sqrt;
// Print the 60 vertices of a uniform truncated icosahedron (soccer ball)
enum real Phi = (1.0 + sqrt(5.0)) / 2.0; // Golden ratio