OK, here's a trick I was thinking about. Currently we have these massive
hashtable refs:
$pms-{conf}-{rbl_evals}
{head_tests}
{body_tests}
{scoreset}-[0,1,2,3]
{tflags}
Each of those is keyed by
[EMAIL PROTECTED] (Justin Mason) writes:
Array lookups are quite a bit faster than hash lookups.
+1
--
Daniel Quinlan ApacheCon! 13-17 November (3 SpamAssassin
http://www.pathname.com/~quinlan/ http://www.apachecon.com/ sessions more)
so I'm thinking that we should replace parts of this with arrays, using
integer indexes, instead of hashes with string indexes.
Array lookups are quite a bit faster than hash lookups.
I have no idea how painful linked lists are in Perl (or if they even exist).
But if you are essentially
I have no idea how painful linked lists are in Perl (or if they even
exist).
Why are you commenting then???
Because they are very useful, as I pointed out.
They don't exist as a native data structure. Arrays are fast, painless,
and dynamically sized.
They don't exist as a native data
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Loren Wilton writes:
I have no idea how painful linked lists are in Perl (or if they even
exist).
Why are you commenting then???
Because they are very useful, as I pointed out.
They don't exist as a native data structure. Arrays are
That is an unreasonablly nasty retort.
Original Message:
-
From: Daniel Quinlan [EMAIL PROTECTED]
Date: 27 Sep 2004 22:53:38 -0700
To: [EMAIL PROTECTED], dev@spamassassin.apache.org
Subject: Re: speedup for PerMsgStatus
Loren Wilton [EMAIL PROTECTED] writes:
I have no idea how
