Re: Bit counting benchmarks Was: count of 1s in a binary number
From: Michele Dondi (bik.mido_at_tiscalinet.it)
Date: 11/24/03
- Next message: ctcgag_at_hotmail.com: "Re: Protecting Source code of a perl script"
- Previous message: Stan Brown: "Re: Image::Magick memory leak question"
- In reply to: Ilya Zakharevich: "Re: Bit counting benchmarks Was: count of 1s in a binary number"
- Next in thread: Ilya Zakharevich: "Re: count of 1s in a binary number"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Mon, 24 Nov 2003 15:27:35 +0100
On Sat, 22 Nov 2003 23:18:58 +0000 (UTC), Ilya Zakharevich
<nospam-abuse@ilyaz.org> wrote:
>> Not an attempt to revive this thread (it *was* a good one)
>
>Ok, so let *me* attempt to revive it. ;-)
[snip]
>I do not see the *other* optimization I (kinda ;-) mentioned used:
Also, as another attempt to (*sort of*) reviving it, why don't you
include also less performant solutions that may be useful when
conjuring up a quick hack, such as those based upon tr/// et similia?
This would be, as I hinted in my previous post, mostly for educational
purposes...
Michele
-- # This prints: Just another Perl hacker, seek DATA,15,0 and print q... <DATA>; __END__
- Next message: ctcgag_at_hotmail.com: "Re: Protecting Source code of a perl script"
- Previous message: Stan Brown: "Re: Image::Magick memory leak question"
- In reply to: Ilya Zakharevich: "Re: Bit counting benchmarks Was: count of 1s in a binary number"
- Next in thread: Ilya Zakharevich: "Re: count of 1s in a binary number"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]