popFront causing more memory to be used

ixid nuaccount at gmail.com
Tue Jul 3 10:16:30 PDT 2012


In any case with large values of k the branch prediction will be 
right almost all of the time, explaining why this form is faster 
than modulo as modulo is fairly slow while this is a correctly 
predicted branch doing an addition if it doesn't make it 
branchless. The branchless version gives the same time result as 
branched, is there a way to force that line not to optimized to 
compare the predicted version?




More information about the Digitalmars-d-learn mailing list