https://issues.dlang.org/show_bug.cgi?id=8405
Seb changed:
What|Removed |Added
Status|NEW |RESOLVED
CC|
https://issues.dlang.org/show_bug.cgi?id=8405
Vladimir Panteleev changed:
What|Removed |Added
Severity|normal
https://issues.dlang.org/show_bug.cgi?id=8405
Andrei Alexandrescu changed:
What|Removed |Added
Keywords||bootcamp
https://issues.dlang.org/show_bug.cgi?id=8405
Andrei Alexandrescu and...@erdani.com changed:
What|Removed |Added
Version|unspecified |D2
--
https://issues.dlang.org/show_bug.cgi?id=8405
--- Comment #4 from John Colvin john.loughran.col...@gmail.com ---
(In reply to bearophile_hugs from comment #3)
(In reply to Peter Alexander from comment #1)
How do you make opIndex O(1) for a joiner range? Surely you have to count up
the
https://issues.dlang.org/show_bug.cgi?id=8405
--- Comment #5 from bearophile_h...@eml.cc ---
(In reply to John Colvin from comment #4)
Unless there is an exploitable pattern in the lengths (rectangular being the
easiest case), given a NxM range of ranges, it's still O(N).
If you store the row
https://issues.dlang.org/show_bug.cgi?id=8405
bearophile_h...@eml.cc changed:
What|Removed |Added
CC||bearophile_h...@eml.cc
--- Comment
https://issues.dlang.org/show_bug.cgi?id=8405
--- Comment #3 from bearophile_h...@eml.cc ---
(In reply to Peter Alexander from comment #1)
How do you make opIndex O(1) for a joiner range? Surely you have to count up
the lengths of all the sub ranges until you hit the desired index? That's
https://issues.dlang.org/show_bug.cgi?id=8405
John Colvin john.loughran.col...@gmail.com changed:
What|Removed |Added
CC|