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

Merge pull request #7090 from burner/std.algorithm.setops_assert_messages

Browse source 
Addes assert messages
merged-on-behalf-of: Nicholas Wilson <thewilsonator@users.noreply.github.com>
This commit is contained in:
The Dlang Bot 2019-06-25 16:33:37 +02:00 • committed by GitHub
commit c256ecf65b
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

26
std/algorithm/setops.d
View file

@ -415,7 +415,8 @@ if (ranges.length >= 2 &&
return copy; return copy;
} }
} }
static assert(isForwardRange!Result); static assert(isForwardRange!Result, Result.stringof ~ " must be a forward"
~ " range");
return Result(ranges); return Result(ranges);
} }
@ -884,7 +885,8 @@ struct MultiwayMerge(alias less, RangeOfRanges)
return; return;
} }
// Put the popped range back in the heap // Put the popped range back in the heap
_heap.conditionalInsert(_ror.back) || assert(false); const bool worked = _heap.conditionalInsert(_ror.back);
assert(worked, "Failed to insert item into heap");
} }
} }
@ -1060,7 +1062,7 @@ public:
/// ///
@property auto ref front() @property auto ref front()
{ {
assert(!empty); assert(!empty, "Can not get front of empty SetDifference");
return r1.front; return r1.front;
} }
@ -1192,11 +1194,12 @@ public:
/// ///
void popFront() void popFront()
{ {
assert(!empty); assert(!empty, "Can not popFront of empty SetIntersection");
static if (Rs.length > 1) foreach (i, ref r; _input) static if (Rs.length > 1) foreach (i, ref r; _input)
{ {
alias next = _input[(i + 1) % Rs.length]; alias next = _input[(i + 1) % Rs.length];
assert(!comp(r.front, next.front)); assert(!comp(r.front, next.front), "Set elements must not"
~ " contradict the less predicate");
} }
foreach (ref r; _input) foreach (ref r; _input)
@ -1209,7 +1212,7 @@ public:
/// ///
@property ElementType front() @property ElementType front()
{ {
assert(!empty); assert(!empty, "Can not get front of empty SetIntersection");
return _input[0].front; return _input[0].front;
} }
@ -1349,7 +1352,7 @@ public:
/// ///
void popFront() void popFront()
{ {
assert(!empty); assert(!empty, "Can not popFront of empty SetSymmetricDifference");
if (r1.empty) r2.popFront(); if (r1.empty) r2.popFront();
else if (r2.empty) r1.popFront(); else if (r2.empty) r1.popFront();
else else
@ -1361,7 +1364,8 @@ public:
} }
else else
{ {
assert(comp(r2.front, r1.front)); assert(comp(r2.front, r1.front), "Elements of R1 and R2"
~ " must be different");
r2.popFront(); r2.popFront();
} }
} }
@ -1371,9 +1375,11 @@ public:
/// ///
@property auto ref front() @property auto ref front()
{ {
assert(!empty); assert(!empty, "Can not get the front of an empty"
~ " SetSymmetricDifference");
immutable chooseR1 = r2.empty || !r1.empty && comp(r1.front, r2.front); immutable chooseR1 = r2.empty || !r1.empty && comp(r1.front, r2.front);
assert(chooseR1 || r1.empty || comp(r2.front, r1.front)); assert(chooseR1 || r1.empty || comp(r2.front, r1.front), "Failed to"
~ " get appropriate front");
return chooseR1 ? r1.front : r2.front; return chooseR1 ? r1.front : r2.front;
} }