On Tue, 10 Apr 2007, Cronfy wrote:
>
> I'am just wondering if there is any solution for this already,
> for me not to reinvent wheel.
The ratelimit code was designed to minimise the amount of data it needs to
store: for each lookup key it only stores the options, the time of the
last rate measurement, and the rate at that time. For counting unique
recipients you'd need a completely different mechanism, and it
would need to be reasonably cunning to limit the amount of storage
required, and the time it takes to decide whether to block or not.
I'd suggest hacking your own solution up using ${perl or ${readsocket.
Tony.
--
<fanf@???> <dot@???>
http://dotat.at/ ${sg{\N${sg{\
N\}{([^N]*)(.)(.)(.*)}{\$1\$3\$2\$1\$3\n\$2\$3\$4\$3\n\$3\$2\$4}}\
\N}{([^N]*)(.)(.)(.*)}{\$1\$3\$2\$1\$3\n\$2\$3\$4\$3\n\$3\$2\$4}}
