You need to redownload the zip.  I just applied the code changes today.  Hence 
my post, today.

Joe

From: Qingshan Xie [mailto:[email protected]]
Sent: Wednesday, July 03, 2013 1:12 PM
To: [email protected]; Joe Gooch
Subject: Re: [Pound Mailing List] multiple URLs configured on Pound not working

Joe,
    I had pound-2.7b installed last week. it worked on "URLMatch Or", but not 
worked on "OrURLs", it failed at startup because of  "unknown directive".  is 
there a new source code of 2.7b I should download?

Thanks, Q.Xie


________________________________
From: Qingshan Xie <[email protected]<mailto:[email protected]>>
To: "[email protected]<mailto:[email protected]>" 
<[email protected]<mailto:[email protected]>>; Joe Gooch 
<[email protected]<mailto:[email protected]>>
Sent: Wednesday, July 3, 2013 9:54 AM
Subject: Re: [Pound Mailing List] multiple URLs configured on Pound not working

Hello Joe,
    how many lines of URLs for OrURLs, or what is the limit of OrURLs?  Could 
it handle ~1000 lines?

Thanks, Q.Xie

________________________________
From: Joe Gooch <[email protected]<mailto:[email protected]>>
To: "'[email protected]'" <[email protected]<mailto:[email protected]>>
Sent: Wednesday, July 3, 2013 8:14 AM
Subject: RE: [Pound Mailing List] multiple URLs configured on Pound not working

Stage for upstream 2.7b now has an alternative method.

OrURLs
  URL "Url1"
  URL "Url2"
  ...
End

Patterns are combined into a single ((url1)|(url2)) string and compiled as one 
pattern.
Joe

> -----Original Message-----
> From: Robert Segall [mailto:[email protected]<mailto:[email protected]>]
> Sent: Tuesday, July 02, 2013 10:21 AM
> To: [email protected]<mailto:[email protected]>
> Subject: Re: [Pound Mailing List] multiple URLs configured on Pound not
> working
>
> On Mon, 2013-07-01 at 20:31 +0000, Joe Gooch wrote:
> > ... Then it’s a single regex match.  (Albeit a complicated one… I’ve
> > never benchmarked 1000 regex_matches vs a pattern with 1000 ors)
>
> A regex match runs in O(len(S)), where S is the string being matched.
> The complexity of the pattern makes no real difference, it is compiled
> to an optimised finite state machine. You pay a few bytes in memory
> usage, but at runtime it is just a table look-up.
>
> 1000 regex matches would be 1000 times slower!
> --
> Robert Segall
> Apsis GmbH
> Postfach, Uetikon am See, CH-8707
> Tel: +41-32-512 30 19
>
>
> --
> To unsubscribe send an email with subject unsubscribe to
> [email protected].<mailto:[email protected].>
> Please contact [email protected]<mailto:[email protected]> for questions.


Reply via email to