Salut Guilhem, hallo Helmer, --- Guilhem Lavaux <[EMAIL PROTECTED]> wrote: > On Thursday 03 July 2003 19:22, Dalibor Topic wrote: > > hi Helmer, > > > > --- Helmer Krämer <[EMAIL PROTECTED]> wrote: > > > i think even i<k is still wrong ;) n Is the length of the string > > > and m is the length of the pattern, so the largest possible start > > > index of the pattern is n-m-1. Therefore it should be n-m-1 and > > > <=k or n-m and <k, shouldn't it? > > > > I've checked Guilhem's patch in as it is. > > > > But your stricter interpretation makes sense. Could you build a rt.jar with > > the current CVS head, and another with a stricter limit and check if they > > are equal, and that the stricter interpretation passes the regression test > > suite? > > > > cheers, > > dalibor topic > > > > I have checked with k=n-m and i<k at the same time against k=n-m and i<=k. > Apparently the both give a successful compilation and the disassembly of both > > rt.jar is completely the same. I suggest we keep the strictest limit.
thanks for looking at it. I've checked the strictest limit in. cheers, dalibor topic __________________________________ Do you Yahoo!? SBC Yahoo! DSL - Now only $29.95 per month! http://sbc.yahoo.com _______________________________________________ kaffe mailing list [EMAIL PROTECTED] http://kaffe.org/cgi-bin/mailman/listinfo/kaffe