On Thursday, 13 February 2014 at 17:41:37 UTC, monarch_dodra
wrote:
On Thursday, 13 February 2014 at 14:45:44 UTC, bearophile wrote:
Stephan Schiffels:
It would be actually easy to implement chunks without the
save function, by using an internal buffer, which would
however make this
On Thursday, 31 October 2013 at 10:35:54 UTC, Stephan Schiffels
wrote:
On Wednesday, 30 October 2013 at 20:43:54 UTC, qznc wrote:
On Wednesday, 30 October 2013 at 00:20:12 UTC, Stephan
Schiffels wrote:
Hi,
I'd like a version of std.range.chunk that does not require
the range to have the
Stephan Schiffels:
It would be actually easy to implement chunks without the
save function, by using an internal buffer, which would
however make this algorithm's memory burden linear in the chunk
size. Would that be acceptable?
I think it's acceptable. But perhaps you need to add one more
On Thursday, 13 February 2014 at 14:45:44 UTC, bearophile wrote:
Stephan Schiffels:
It would be actually easy to implement chunks without the
save function, by using an internal buffer, which would
however make this algorithm's memory burden linear in the
chunk size. Would that be
On Wednesday, 30 October 2013 at 20:43:54 UTC, qznc wrote:
On Wednesday, 30 October 2013 at 00:20:12 UTC, Stephan
Schiffels wrote:
Hi,
I'd like a version of std.range.chunk that does not require
the range to have the length property.
As an example, consider a file that you would like parse
On Wednesday, 30 October 2013 at 00:20:12 UTC, Stephan Schiffels
wrote:
Hi,
I'd like a version of std.range.chunk that does not require the
range to have the length property.
As an example, consider a file that you would like parse by
lines and always lump together four lines, i.e.
import
Hi,
I'd like a version of std.range.chunk that does not require the
range to have the length property.
As an example, consider a file that you would like parse by lines
and always lump together four lines, i.e.
import std.stdio;
void main() {
auto range = File(test.txt, r).byLine();
