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

retro(retro(range)) is range

Browse Source
This commit is contained in:
Nathan Sashihara 2018-11-05 17:06:09 -05:00
parent 184d307e40
commit c290c85088
1 changed files with 27 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -408,22 +408,10 @@ if (isInputRange!R)
} }
} }
/** private
* Iterates a bidirectional range backwards.
*
* If $(D_PARAM Range) is a random-access range as well, the resulting range
* is a random-access range too.
*
* Params:
* Range = Bidirectional range type.
* range = Bidirectional range.
*
* Returns: Bidirectional range with the elements order reversed.
*/
auto retro(Range)(Range range)
if (isBidirectionalRange!Range)
{ {
static struct Retro // Reverse-access-order range returned by `retro`.
struct Retro(Range)
{ {
Range source; Range source;
@ -526,9 +514,31 @@ if (isBidirectionalRange!Range)
} }
} }
} }
version (unittest) static assert(isBidirectionalRange!Retro);
}
} }
return Retro(range); /**
* Iterates a bidirectional range backwards.
*
* If $(D_PARAM Range) is a random-access range as well, the resulting range
* is a random-access range too.
*
* Params:
* Range = Bidirectional range type.
* range = Bidirectional range.
*
* Returns: Bidirectional range with the elements order reversed.
*/
auto retro(Range)(return Range range)
if (isBidirectionalRange!Range)
{
// Special case: retro(retro(range)) is range
static if (is(Range == Retro!RRange, RRange))
return range.source;
else
return Retro!Range(range);
} }
/// ///