On Tue, 2003-06-10 at 11:01, Carsten Ziegeler wrote: > Bruno Dumon wrote: > > On Tue, 2003-06-10 at 10:02, Carsten Ziegeler wrote: > > > Sylvain Wallez wrote: > > > > > > > > What about using the two ;-) > > > > 1/ test if the URI is absolute. For this, you can use Excalibur's > > > > SourceUtil.getScheme() which performs a strict control on > > scheme syntax > > > > without using a regexp. > > > > 2/ if not, use the regexp only on the part before the '?' > > (BTW, if '?' > > > > is part of the URI, it should be encoded as %3F > > > > > > > That's what I tried to propose :) > > > > > > > (Just now awakening) > > > > Is this the cause of the infinite loop, or is that still a seperate > > problem? > > > My first guess that it is an infinite loop seems to be incorrect. It's > rather > that evaluation the regexp is implemented recursivly and that the longer > the uri to test is, the more recursive calls you get. So in fact it > is not an infinite loop but looks like one. > So there is the hope that if 2/ is implemented, the recursion should be > not that deep and fix the problem for now. 1/ is just a performance > update. >
Yep, after trying it out I saw it too. Anybody working on this already? (or can I do it?) -- Bruno Dumon http://outerthought.org/ Outerthought - Open Source, Java & XML Competence Support Center [EMAIL PROTECTED] [EMAIL PROTECTED]
