Challenge: write a reference counted slice that works as much as possible like a built-in slice

claptrap clap at trap.com
Thu Nov 11 21:32:28 UTC 2021


On Thursday, 11 November 2021 at 16:09:46 UTC, Stanislav Blinov 
wrote:
> On Thursday, 11 November 2021 at 09:15:54 UTC, Atila Neves
>>
>> My algorithm:
>> 1. Write code
>> 2. Did I notice it being slow or too big? Go to 4.
>> 3. Move on to the next task.
>> 4. Profile and optimise, go to 2.
>
> That's an interesting way of doing science. How would you 
> notice anything without a baseline, which you haven't even set 
> yet because you're not at (4)?

Maybe it needs to hit a certain FPS, or maybe its "are a lot of 
people complaining that it's slow", or "hmm i though that would 
be a lot faster". You have users, expectations, requirements 
etc.. Could be a whole bunch of reasons to jump to 4, it doesn't 
require an absolute "this is measurably slower than version 1.03"


More information about the Digitalmars-d mailing list