On Friday, 7 August 2015 at 05:21:32 UTC, Tofu Ninja wrote:
HAHAH wow, this is hilarious, I just checked, nothing in
std.algo takes advantage of sorted ranges, sort doesn't even
take advantage of it! You pass a sorted range into sort and it
will just resort it! Wow
Who fixes this?
I can
On Friday, 7 August 2015 at 08:18:04 UTC, Nordlöw wrote:
On Friday, 7 August 2015 at 05:21:32 UTC, Tofu Ninja wrote:
HAHAH wow, this is hilarious, I just checked, nothing in
std.algo takes advantage of sorted ranges, sort doesn't even
take advantage of it! You pass a sorted range into sort and
On Friday, 7 August 2015 at 08:18:04 UTC, Nordlöw wrote:
On Friday, 7 August 2015 at 05:21:32 UTC, Tofu Ninja wrote:
HAHAH wow, this is hilarious, I just checked, nothing in
std.algo takes advantage of sorted ranges, sort doesn't even
take advantage of it! You pass a sorted range into sort and
On Friday, 7 August 2015 at 10:01:39 UTC, Timon Gehr wrote:
On 08/07/2015 11:03 AM, Tofu Ninja wrote:
On Friday, 7 August 2015 at 08:18:04 UTC, Nordlöw wrote:
On Friday, 7 August 2015 at 05:21:32 UTC, Tofu Ninja wrote:
HAHAH wow, this is hilarious, I just checked, nothing in
std.algo
takes
On 08/07/2015 11:03 AM, Tofu Ninja wrote:
On Friday, 7 August 2015 at 08:18:04 UTC, Nordlöw wrote:
On Friday, 7 August 2015 at 05:21:32 UTC, Tofu Ninja wrote:
HAHAH wow, this is hilarious, I just checked, nothing in std.algo
takes advantage of sorted ranges, sort doesn't even take advantage of
On Friday, 7 August 2015 at 04:23:21 UTC, Ali Çehreli wrote:
Do you want to see SortedRange 1700 times faster? ;)
On 08/06/2015 05:35 PM, Tofu Ninja wrote: void main()
auto temp = assumeSorted(a).find(f);
SortedRange does not have a find() member. What happens is, it
goes to find()
On Friday, 7 August 2015 at 05:01:41 UTC, Tofu Ninja wrote:
On Friday, 7 August 2015 at 04:23:21 UTC, Ali Çehreli wrote:
Do you want to see SortedRange 1700 times faster? ;)
On 08/06/2015 05:35 PM, Tofu Ninja wrote: void main()
auto temp = assumeSorted(a).find(f);
SortedRange does
Do you want to see SortedRange 1700 times faster? ;)
On 08/06/2015 05:35 PM, Tofu Ninja wrote: void main()
auto temp = assumeSorted(a).find(f);
SortedRange does not have a find() member. What happens is, it goes to
find() algorithm. Replace that line with
auto temp =
void main()
{
auto a = new int[100*1024*1024];
for(int i = 0; i 100*1024*1024; i++)
{
a[i] = i;
}
enum f = 100*1024*1000;
StopWatch sw;
{
sw.start();
auto temp = assumeSorted(a).find(f);
On Friday, 7 August 2015 at 00:35:58 UTC, Tofu Ninja wrote:
void main()
{
auto a = new int[100*1024*1024];
for(int i = 0; i 100*1024*1024; i++)
{
a[i] = i;
}
enum f = 100*1024*1000;
StopWatch sw;
{
On Friday, 7 August 2015 at 01:26:51 UTC, John Colvin wrote:
As usual, which compiler, which compiler version, which
compilation flags?
dmd v2.067.1
-O -release -w -inline -boundscheck=off
11 matches
Mail list logo
