Return: Adjacent N-Tuples of r.
Return Static Array arr as a Tuple.
Steal back from r destructively and return it. * * See_Also: http://forum.dlang.org/thread/jkbhlezbcrufowxtthmy@forum.dlang.org#post-konhvblwbmpdrbeqhyuv:40forum.dlang.org * See_Also: http://forum.dlang.org/thread/onibkzepudfisxtrigsi@forum.dlang.org#post-dafmzroxvaeejyxrkbon:40forum.dlang.org * See_Also: https://forum.dlang.org/thread/arufovtvoewhyfuesvco@forum.dlang.org
Steal front from r destructively and return it.
Same as iota but with explicit conversion to type T.
Return Array of Key-Value Pairs of Associative Array aa. * * See_Also: https://github.com/D-Programming-Language/druntime/pull/574 * See_Also: http://forum.dlang.org/thread/dxotcrutrlmszlidufcr@forum.dlang.org?page=2#post-fhkgitmifgnompkqiscd:40forum.dlang.org
Overload has questionable memory safety. Would be quite cool if DIP-1000 could support this use case
Faster than std.range.zip on DMD.
Ring Buffer.
Sliding Splitter.
Is the CommonType of the ElementTypes of the ranges Rs.
True if R is a SortedRange
Given a SortedRange R, sortingPredicate!R(a, b) will call in to the * predicate that was used to create the SortedRange. * * Params: * Range = the range to extract the predicate from * fallbackPred = the sorting predicate to fallback to if Range is not a SortedRange
Extensions to std.range.