OSS/tanya
1
0
Fork 0
Code Issues 1 Pull Requests Releases Activity

Build with -dip1000. Fix #85

Browse Source
This commit is contained in:
Eugen Wissner
2019-04-15 06:42:57 +02:00
parent 9814e5ad8e
commit f66935f40d
12 changed files with 24 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
source/tanya/algorithm/iteration.d
View File

@ -39,7 +39,7 @@ private enum hasConstLength(T) = is(typeof(((const T* a) => (*a).length)(null))
private enum hasConstSave(T) = is(typeof(((const T* a) => (*a).save())(null)) : T);
private enum hasConstSlice(T) = is(typeof(((const T* a) => (*a)[0 .. $])(null)) : T);
unittest
@nogc nothrow pure @safe unittest
{
// Test the definitions.
static assert(hasInoutFront!string);
@ -420,7 +420,7 @@ private struct Retro(Range)
@disable this();
private this(Range source)
private this(Range source) @safe
{
this.source = source;
}
@ -545,7 +545,7 @@ private struct Retro(Range)
*
* Returns: Bidirectional range with the elements order reversed.
*/
auto retro(Range)(return Range range)
auto retro(Range)(Range range)
if (isBidirectionalRange!Range)
{
// Special case: retro(retro(range)) is range