On Monday, 5 August 2013 at 14:47:37 UTC, dennis luehring wrote:
> Ok, how would you make it faster?
i don't see a better solution here - how to reduce ONE
lowercase and SOME compares in any way? (i dont think a hash or
something will help) but i know that anything like your
continue-party is worth nothing (feels a little bit like
script-kiddies "do it with assembler that would it make million
times faster" blabla)
question: is this the slow part in your project?
do you know it for sure or just an emotion - HOW do you
benchmark?
Am 05.08.2013 16:31, schrieb jicman:
On Monday, 5 August 2013 at 14:27:43 UTC, dennis luehring
wrote:
did you benchmarked your current szenario - how do you know
that this is the slow part - or are you working on an
only-extension-compare-tool?
btw: they are both equal and slow - and full of partly
code-duplication
std.string.tolower(fext[0]) multiple times, i hope your list
isn't going much longer
Ok, how would you make it faster?
It is a tool that was a script, but I have turned it into do,
which now has taken two hours from the last jscript script. I
have not benchmarked it, yet. I may. But I see that a great
idea has been provided, which I will use. Thanks for the help.